• Journal of Communications and Networks
• /
• v.4 no.2
• /
• pp.81-89
• /
• 2002

In this paper, we design and implement an efficient fair off-line electronic cash system based on Elliptic Curve Discrete Logarithm Problem (ECDLP), in which the anonymity of coins is revocable by a trustee in case of dispute. To achieve this, we employ the Petersen and Poupard s electronic cash system [1] and extend it by using an elliptic curve over the finite field GF($2^n$). This naturally reduces message size by 85% compared with the original scheme and makes a smart card to store coins easily. Furthermore, we use the Baek et al. s provably secure public key encryption scheme [2] to improve the security of electronic cash system. As an extension, we propose a method to add atomicity into new electronic cash system. To the best of our knowledge, this is the first result to implement a fair off-line electronic cash system based on ECDLP with provable security.

• 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 for History of Mathematics
• /
• v.27 no.6
• /
• pp.409-419
• /
• 2014

In school mathematics, the logarithmic function is defined as the inverse function of an exponential function. And the natural logarithm is defined by the integral of the fractional function 1/x. But historically, Napier had already used the concept of logarithm in 1614 before the use of exponential function or integral. The calculation of the logarithm was a hard work. So mathematicians with arithmetic ability made the tables of values of logarithms and people used the tables for the estimation of data. In this paper, we first take a look at the mathematicians and mathematical principles related to the appearance and the developments of the logarithmic tables. And then we deal with the confusions between mathematicians, raised by the estimation data which were known as proportional parts or mean differences in common logarithmic tables.

• 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.

• East Asian mathematical journal
• /
• v.30 no.1
• /
• pp.31-50
• /
• 2014

In this paper we establish limsup results and a generalized uniform law of the iterated logarithm (LIL) for the increments of partial sums of strictly stationary and linearly positive quadrant dependent (LPQD) or linearly negative quadrant dependent (LNQD) random sequences.

• Bulletin of the Korean Mathematical Society
• /
• v.35 no.2
• /
• pp.209-225
• /
• 1998

In this paper we obtain sharp upper and lower bounds of small ball oprobabilities for Gaussian processes with stationary increments, whose results are essential to estabilish Chung type laws of iterated logarithm.

• Journal of the Korean Mathematical Society
• /
• v.49 no.2
• /
• pp.223-233
• /
• 2012

In this paper we establish some limsup results and a generalized uniform law of the iterated logarithm (LIL) for the increments of partial sums of a strictly stationary and linearly positive quadrant dependent (LPQD) sequence of random variables.

• Journal of the Korean Mathematical Society
• /
• v.36 no.3
• /
• pp.509-525
• /
• 1999

In this paper we obtain sharp upper and lower bounds of samll ball and large deviation probabilities for the increments of Gaussian processes with stationary increments, whose results are essential to establish Chung type laws of iteratted logarithm.

• Communications for Statistical Applications and Methods
• /
• v.20 no.3
• /
• pp.185-191
• /
• 2013

Kiefer (1961) studied asymptotic behavior of empirical distribution using the law of the iterated logarithm. Robertson and Wright (1974a) discussed whether this type of result would hold for a maximum likelihood estimator of a stochastically ordered distribution function; however, we show that this cannot be achieved. We provide only a partial answer to this problem. The result is applicable to both estimation and testing problems under the restriction of stochastic ordering.

• Journal of the Korean Data and Information Science Society
• /
• v.2
• /
• pp.41-44
• /
• 1991

Petrov (1968) gave two theorems on the law of the iterated logarithm without any assumptions about the existence of moments of independent random variables. In the present paper we show that the same holds true for sign-invariant random variables.