• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.13 no.2
• /
• pp.91-98
• /
• 2003

We introduce a new public key system based on the discrete logarithm Problem(DLP) in a quotient group of finite fields. This system achieves savings not only in communication overhead by reducing public key size and transfer data by half but also in computational costs by performing efficient exponentiation. In particular, this system takes about 50% speed-up, compared to DSA which has the same security.

• Journal of the Korean Mathematical Society
• /
• v.35 no.3
• /
• pp.675-690
• /
• 1998

A role of singletons in quantum central limit theorems is studied. A common feature of quantum central limit distributions, the singleton condition which guarantees the symmetry of the limit distributions, is revisited in the category of discrete groups and monoids. Introducing a general notion of quantum independence, the singleton independence which include the singleton condition as an extremal case, we clarify the role of singletons and investigate the mechanism of arising non-symmetric limit distributions.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 1999.10a
• /
• pp.127-134
• /
• 1999

An optimization algorithm based on Genetic Algorithm(GA) is developed for discrete optimization of reinforced concrete plane frame by constructing databases. Under multiple loading conditions, discrete optimum sets of reinforcements for both negative and positive moments in beams, their dimensions, column reinforcement, and their column dimensions are found. Construction practice is also implemented by linking columns and beams by group ‘Connectivity’between columns located in the same column line is also considered. It is shown that the developed genetic algorithm was able to reach optimum design for reinforced concrete plane frame construction practice.

• Journal of the Korean Mathematical Society
• /
• v.52 no.4
• /
• pp.797-819
• /
• 2015

A trapdoor discrete logarithm group is a cryptographic primitive with many applications, and an algorithm that allows discrete logarithm problems to be solved faster using a pre-computed table increases the practicality of using this primitive. Currently, the distinguished point method and one extension to this algorithm are the only pre-computation aided discrete logarithm problem solving algorithms appearing in the related literature. This work investigates the possibility of adopting other pre-computation matrix structures that were originally designed for used with cryptanalytic time memory tradeoff algorithms to work as pre-computation aided discrete logarithm problem solving algorithms. We find that the classical Hellman matrix structure leads to an algorithm that has performance advantages over the two existing algorithms.

• Nuclear Engineering and Technology
• /
• v.22 no.2
• /
• pp.151-158
• /
• 1990

The new discrete elements method (DEM) is applied to the one-group neutron transport equation in one-dimensional slab geometry. The fixed source and the criticality problems are treated and three spatial differencing schemes (the DD, the SC, -and the LC schemes) are tested to determine the most computationally efficient in the DEM. In all cases, the accuracy of the results obtained from the DEM shows an improvement over that obtained from the standard discrete ordinates calculations. And the LC scheme gives the most accurate results in the DEM.

• Journal of Plant Biology
• /
• v.29 no.2
• /
• pp.129-133
• /
• 1986

Transections of the stem region close to the shoot apex show the occurrence of an outer, complete ring of procambium and an inner group of discrete procambial strands. From the outer ring, small, discrete vascular bundles and vascular cambium originate, while the inner group forms the discrete, medullary vascular bundles with intrafascicular cambium. Secondary thickening is essentially due to the activity of the cylinder or complete ring of vascular cambium that originates from the procambium. The medullary intrafascicular cambia also form some secondary tissues. The vascular cambium produces secondary xylem inwards and secondary phloem outwards as in the normal secondary thickening process. The distinctive feature, however, is perpetual discreteness of the medullary vascular bundles. No successive series of cambia or secondary vascular bundles are found.

• Proceedings of the KIEE Conference
• /
• 2001.07d
• /
• pp.2576-2578
• /
• 2001

Elliptic curve cryptosystems based on discrete logarithm problem in the group of points of an elliptic curve defined over a finite field. The discrete logarithm in an elliptic curve group appears to be more difficult than discrete logarithm problem in other groups while using the relatively small key size. An implementation of elliptic curve cryptosystems needs finite field arithmetic computation. Hence finite field arithmetic modules must require less hardware resources to archive high performance computation. In this paper, a new architecture of finite field multiplier using conversion scheme of normal basis representation into polynomial basis representation is discussed. Proposed architecture provides less resources and lower complexity than conventional bit serial multiplier using normal basis representation. This architecture has synthesized using synopsys FPGA express successfully.

• Journal of Korea Society of Industrial Information Systems
• /
• v.23 no.1
• /
• pp.53-63
• /
• 2018

In this paper, we analyze the waiting time of a queueing system with D-BMAP (discrete-time batch Markovian arrival process) and D-policy. Customer group or packets arrives at the system according to discrete-time Markovian arrival process, and an idle single server becomes busy when the total service time of waiting customer group exceeds the predetermined workload threshold D. Once the server starts busy period, the server provides service until there is no customer in the system. The steady-state waiting time distribution is derived in the form of a generating function. Mean waiting time is derived as a performance measure. Simulation is also performed for the purpose of verification and validation. Two simple numerical examples are shown.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.9 no.3
• /
• pp.3-12
• /
• 1999

The public key crytptosystem is represented by RSA based on the difficulty of integer factorization and ElGamal cryptosystem based on the intractability of the discrete logarithm problem in a cyclic group G. The index-calculus algorithm for discrete logarithms in GF${$q^n$}^+$ requires an polynomial factorization. The Niederreiter recently developed deterministic facorization algorithm for polynomial over GF$q^n$ In this paper we implemented the arithmetic of finite field with c-language and gibe an implementation of the Niederreiter's algorithm over GF$2^n$ using normal bases.

• Honam Mathematical Journal
• /
• v.31 no.3
• /
• pp.279-292
• /
• 2009

As a survey-type article, the paper reviews some results on a regular covering space in digital covering theory. The recent paper [10](see also [12]) established the notion of regular covering space in digital covering theory and studied its various properties. Besides, the papers [14, 16] developed a discrete Deck's transformation group of a digital covering. In this paper we study further their properties. By using these properties, we can classify digital covering spaces. Finally, the paper proposes an open problem.