[KSCI] Korea Science Citation Index Service

http://dx.doi.org/10.13089/JKIISC.2003.13.2.91

A new discrete logarithm problem with public parameter key-size reduction

박영호 (세종사이버대학교, 컴퓨터공학부)
오상호 (시큐어웍스테크놀러지)
주학수 (한국정보보호진흥원)

Publication Information

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

Abstract

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.

Keywords

Discrete Logarithm Problem; Quotient Group; Finite Field; Public Key Cryptosystem;

Citations & Related Records

Reference

1	Faster Point Multiplication on Elliptic Curves with Efficient Endomophisms / [ R.Gallant;R.Lambert;S.Vanstone ] / CRYPTO' 2001, LNCS 2139
2	Using Cyclotomic Polynomials to Construct Efficient Discrete Logarithm Cryptosystems over Finite Fields / [ A.K.Lenstra ] / Proceedings ACISP97, LNCS 1270
3	New directions in cryptography / [ W.Diffie;M.Hellman ] / IEEE Trans. on Information Theory
4	A public-key cryptosystem and a digital signature system based on the Lucas function analogue discrete logarithms / [ P.Smith;C.Skinner ] / Asiacrypt'94
5	/ [ V.Shoup ] / NTL 4.0
6	The XTR public key system / [ A.K.Lenstra;E.R.Verheul ] / Crypto 2000, LNCS 1880
7	Elliptic Curves in Cryptography / [ Ian Blake;Gadiel Seroussi;Nigel Smart ] / London Mathematical Society Lecture Note Series. 265
8	A Public Key Cryptosystem and a Signature scheme Based on Discrete Logarithms / [ T.ElGamal ] / IEEE Trans. on Information Theory
9	Efficient signature generation by smart cards / [ C.P.Schnorr ] / Journal of Cryptology
10	Some Remarks on Lucas-Based Cryptosysems / [ D.Bleichenbacher;W.Bosma;A.Lenstra ] / Crypto'95
11	/ [] / American National Standard
12	A Subexponential-Time Algorithm for Computing Discrete Logarithms over GF(p²) / [ T.ElGamal ] / IEEE Trans. on Information Theory
13	Doing more with fewer bits / [ A.E.Brouwer;R.Rellikaan;E.R.Verheul ] / Proceedings Asiacrypt99, LNCS 1716
14	Fast consturction of irreducible polynomials over finite fields / [ V.Shoup ] / Journal of symbolic computation ScienceOn
15	/ [ A.J.Menezes;P.C.van Oorschot;S.A.Vanstone ] / Handbook of applied cryptography

KSCI

A new discrete logarithm problem with public parameter key-size reduction 공개 파라메터 키 크기를 줄인 새로운 이산대수문제

A new discrete logarithm problem with public parameter key-size reduction