Improvement of probabilistic public key cryptosystems using discrete logarithm

DOI10.1007/3-540-45861-1_7MaRDI QIDQ4536639zbMATH OpenFDO

Authors Dug-Hwan Choi, Seung-Bok Choi, Dongho Won

Publication date 24 November 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-45861-1_7

zbMATH Keywords

discrete logarithmic functionefficient algorithmsencryptionprobabilistic public key cryptosystems

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• Public-key cryptosystem based on the discrete logarithm problem
• A public-key cryptosystem based on Lucas sequences
• Efficient probabilistic public-key cryptosystem based on the diffie-hellman problem
• A cryptosystem based on double generalized discrete logarithm problem
• Efficiency vs. security in the implementation of public-key cryptography

Cited in

(3)

• An improved pseudo-random generator based on discrete log
• A new public key cryptosystem over \(\mathbb Z_{n^2}^\ast\)
• The case of small prime numbers versus the Okamoto-Uchiyama cryptosystem

This page was built for publication: Improvement of probabilistic public key cryptosystems using discrete logarithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4536639)