• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.13 no.3
• /
• pp.35-43
• /
• 2003

The randomization of scalar multiplication in ECC is one of the fundamental concepts in defense methods against side-channel attacks. This paper proposes a countermeasure against simple and differential power analysis attacks through randomizing the transformed m-ary method based on a random m-ary receding algorithm. The proposed method requires an additional computational load compared to the standard m-ary method, yet the power consumption is independent of the secret key. Accordingly, since computational tracks using random window width can resist against SPA and DPA, the proposed countermeasure can improve the security for smart cards.

• Journal of the Korea Convergence Society
• /
• v.6 no.1
• /
• pp.85-91
• /
• 2015

Recently government has distributed precautionary measure and response procedures for smishing(SMS phishing), pharming, phishing, memory hacking and intensified Electronic Financial Transaction Act because of the sharp increase of electronic bank frauds. However, the methods of electronic bank frauds also developed and changed accordingly so much it becomes hard to cope with them. In contrast to earlier voice phishing targeted randomizing object, these new methods find out the personal information of targets and analyze them in detail making a big data base. And they are progressed into new kind of electronic bank frauds using those analyzed informations for voice phishing. This study analyze the attack method of voice phishing blended with the Big Data of personal informations and suggests response procedures for electronic bank frauds increasingly developed. Using the method to save meaningless data in a memory, attackers cannot deduct accurate information and try voice phishing properly even though they obtain personal information based on the Big Data. This study analyze newly developed social technologic attacks and suggests response procedures for them.

• Journal of Advanced Navigation Technology
• /
• v.18 no.5
• /
• pp.461-467
• /
• 2014

Active queue management (AQM) algorithms run on routers and detect incipient congestion by typically monitoring the instantaneous or average queue size. When the average queue size exceeds a certain threshold, AQM algorithms infer congestion on the link and notify the end systems to back off by proactively dropping some of the packets arriving at a router or marking the packets to reduce transmission rate at the sender. Among the existing AQM algorithms, random early detection (RED) is well known as the representative queue-based management scheme by randomizing packet dropping. To reduce the number of timeouts in TCP and queuing delay, maintain high link utilization, and remove bursty traffic biases, the RED considers an average queue size as a degree of congestions. However, RED do not well in the specified networks conditions due to the fixed parameters($P_{max}$ and $TH_{min}$) of RED. This paper addresses a extended RED to be adapted in various networks conditions. By sensing network state, $P_{max}$ and $TH_{min}$ can be automatically changed to proper value and then RED do well in various networks conditions.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.3A
• /
• pp.267-277
• /
• 2011

Like other wireless network protocols, IEEE 802.15.4 adopts CA (Collision Avoidance)algorithm to avoid the early collision of a new packet by randomizing its first transmission time rather than its immediate delivery. The traditional CA scheme of IEEE 802.15.4, however, selects the random access time from the predetermined range without considering the degree of current congestion. It probably causes either a long delay to settle in the suitable range for the current network load or frequent clashes especially during the long lasting heavy traffic period. This paper proposes an ACA(Adaptive Collision Avoidance) algorithm adapting the initial backoff range to the undergoing collision variations. It also introduces a mathematical model to predict the performance of ACA algorithm added to IEEE 802.15.4. With only small deviations from corresponding simulations, our analytical model shows that ACA technique can improve the throughput of IEEE 802.15.4 by up-to 41% maximally in addition to shortening the packet delays.

• Journal of the Korean Society of Physical Medicine
• /
• v.17 no.4
• /
• pp.53-63
• /
• 2022

PURPOSE: This study examined the changes in the thickness of the abdominal muscles, including the transversus abdominis, according to the set pressure applied by a pressure biofeedback unit during contractions of the hip adductor muscles. METHODS: After randomizing 40 healthy adult males in their 20 s and 30 s, the participants were instructed to match the pressure gauge indication of the pressure biofeedback device to continue contracting the hip adductor while maintaining it at 10 mmHg (low), 40 mmHg (medium), or 70 mmHg (high). The measurement was taken over five seconds using an ultrasound device. RESULTS: According to the contractile pressure applied to the hip adductor muscle, there was a significant difference in the muscle thickness change of the transverse abdominis muscle between 10 mmHg and 70 mmHg and between 40 mmHg and 70 mmHg. The muscle thickness ratio of the external oblique/abdominal muscle was significantly different between 10 mmHg and 70 mmHg and between 40 mmHg and 70 mmHg. CONCLUSION: Increased contraction pressure on the hip adductor muscle increases the muscle thickness of the abdominal transverse muscle. Interbody stability exercise with contractions of the hip adductor muscle is expected to help increase in the muscle thickness of the hip adductor muscle.

• The Korean Journal of Applied Statistics
• /
• v.23 no.1
• /
• pp.189-196
• /
• 2010

It is never an easy task to physically randomize the sequence of cards. For instance, US 1970 draft lottery resulted in a social turmoil since the outcome sequence of 366 birthday numbers showed a significant relationship with the input order (Wikipedia, "Draft Lottery 1969", Retrieved 2009/05/01). We are motivated by Laplace's 1825 book titled Philosophical Essay on Probabilities that says "Suppose that the numbers 1, 2, ..., 100 are placed, according to their natural ordering, in an urn, and suppose further that, after having shaken the urn, to shuffle the numbers, one draws one number. It is clear that if the shuffling has been properly done, each number will have the same chance of being drawn. But if we fear that there are small differences between them depending on the order in which the numbers were put into the urn, we can decrease these differences considerably by placing these numbers in a second urn in the order in which they are drawn from the first urn, and then shaking the second urn to shuffle the numbers. These differences, already imperceptible in the second urn, would be diminished more and more by using a third urn, a fourth urn, &c." (translated by Andrew 1. Dale, 1995, Springer. pp. 35-36). Laplace foresaw what would happen to us in 150 years later, and, even more, suggested the possible tool to handle the problem. But he did omit the detailed arguments for the solution. Thus we would like to write the supplement in modern terms for Laplace in this research note. We formulate the problem with a lottery box model, to which Markov chain theory can be applied. By applying Markov chains repeatedly, one expects the uniform distribution on k states as stationary distribution. Additionally, we show that the probability of even-number of successes in binomial distribution with trials and the success probability $\theta$ approaches to 0.5, as n increases to infinity. Our theory is illustrated to the cases of truncated geometric distribution and the US 1970 draft lottery.

• Journal of KIISE:Information Networking
• /
• v.36 no.1
• /
• pp.12-23
• /
• 2009

Sensor networks deployed in battlefields to support military operations or deployed in natural habitats to monitor the rare wildlifes must take account of protection of the location of valuable assets(i.e., soldiers or wildlifes) from an adversary or malicious tracing as well as the security of messages in transit. In this paper we propose a routing protocol GSLP(GPSR-based Source-Location Privacy) that is capable of enhancing the location privacy of an active source node(i.e., message-originating node) in the presence of multiple dormant sources(i.e., nodes lying nearby an asset whose location needs to be secured). Extended is a simple, yet scalable, routing scheme GPSR(greedy perimeter stateless routing) to select randomly a next-hop node with a certain probability for randomizing paths and to perform perimeter routing for detouring dormant sources so that the privacy strength of the active source, defined as safety period, keeps enhanced. The simulation results obtained by increasing the number of dormant sources up to 1.0% of the total number of nodes show that GSLP yields increased and nearly invariant safety periods, while those of PR-SP(Phantom Routing, Single Path), a notable existing protocol for source-location privacy, rapidly drop off as the number of dormant sources increases. It turns out that delivery latencies of GSLP are roughly less than two-fold of the shortest path length between the active source and the destination.

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.2
• /
• pp.19-30
• /
• 2013

We study sub-Peres functions that are defined recursively as Peres function for random number generation. Instead of using two parameter functions as in Peres function, the sub-Peres functions uses only one parameter function. Naturally, these functions produce less random bits, hence are not asymptotically optimal. However, the sub-Peres functions runs in linear time, i.e., in O(n) time rather than O(n logn) as in Peres's case. Moreover, the implementation is even simpler than Peres function not only because they use only one parameter function but because they are tail recursive, hence run in a simple iterative manner rather than by a recursion, eliminating the usage of stack and thus further reducing the memory requirement of Peres's method. And yet, the output rate of the sub-Peres function is more than twice as much as that of von Neumann's method which is widely known linear-time method. So, these methods can be used, instead of von Neumann's method, in an environment with limited computational resources like mobile devices. We report the analyses of the sub-Peres functions regarding their running time and the exact output rates in comparison with Peres function and other known methods for random number generation. Also, we discuss how these sub-Peres function can be implemented.

• Korean Journal of Food Science and Technology
• /
• v.21 no.5
• /
• pp.624-632
• /
• 1989

Lipids of Liza carinata roe were extracted and separated into detailed lipid classes by column chromatography. About 57-62% of the total lipids consisted of wax esters in which saturated and unsaturated fatty alcohols combined with fatty acids with up to six double bonds. Between the even-numbered wax ester peaks in gas-liquid chromatography, ones with odd chain lengths such as C31, C33 and C35 were eluted in appreciable amounts. Isomers composed of different fatty acids and alcohols at a given chain length were not resolved on 1.5% OV-17 column. The principal component of wax esters in sample A were C32, C34 and C30 (45.0%, 19.2%, and 12.2%), followed by C36 and C38 length (9.5% and 4.7%), while those in sample B were mainly occupied by C34, C32 and C36 length (36.3%, 31.4% and 14.5%) with minor components C30 and C38 length (5.2%, and 3.4%). The wax esters were not a random combination of constituent fatty acids and alcohols. With increase in boiling temperature the wax esters increased slightly in viscosity over the unboiled, showing a tendency toward randomness, and finally were completely randomized at $360^{\circ}C$ for 40 minutes. The enzymes involved in wax ester biosynthesis seemed to have high selectivity for chain length of fatty acids and alcohols.

• Korean Journal of Microbiology
• /
• v.54 no.4
• /
• pp.420-427
• /
• 2018

The orthogonal pair of Saccharomyces cerevisiae tyrosyl-tRNA synthetase (Sc YRS) and a variant of E. coli initiator tRNA, fMam $tRNA_{CUA}$ which recognizes the amber stop codon is an effective tool for site-specific incorporation of unnatural amino acids into the protein in E. coli. To evolve the amber suppression activity of the orthogonal pair, we generated a mutant library of Sc YRS by randomizing two amino acids at 320 and 321 which involve recognition of the first base of anticodon in fMam $tRNA_{CUA}$. Two positive clones are selected from the library screening with chloramphenicol resistance mediated by amber suppression. They showed growth resistance against high concentration of chloramphenicol and their $IC_{50}$ values were approximately 1.7~2.3 fold higher than the wild type YRS. In vivo amber suppression assay reveals that mutant YRS-3 (mYRS-3) clone containing amino acid substitutions of P320A and D321A showed 6.5-fold higher activity of amber suppression compared with the wild type. In addition, in vitro aminoacylation kinetics of mYRS-3 also showed approximately 7-fold higher activity than the wild type, and the enhancement was mainly due to the increase of tRNA binding affinity. These results demonstrate that optimization of anticodon recognition by engineered aminoacyl tRNA synthetase improves the efficiency of unnatural amino acid incorporation in response to nonsense codon.