Abstract
Most public key cryptosystems have been constructed based on abelian groups up to now. We propose a new public key cryptosystem built on finite non abelian groups in this paper. It is convertible to a scheme in which the encryption and decryption are much faster than other well-known public key cryptosystems, even without no message expansion.
Furthermore a signature scheme can be easily derived from it, while it is difficult to find a signature scheme using a non abelian group.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
I. Anshel, M. Anshel, D. Goldfeld An algebraic method for public-key cryptography, Mathematical Research Letters 6 (1999), 1–5
S. Blackburn, S. Galbraith Cryptanalysis of two cryptsystems based on group actions, Proc. ASIACRYPT’ 99 (2000), 52–61
A. E. Brower, R. Pellikaan, E. R. Verheul Doing more with fewer bits, Proc. ASIACRYPT’ 99 (2000), 321–332
D. Coopersmith, A. M. Odlzyko, R. Schroeppel Discrete logarithms in GF(p), Algorithmica, 1 (1986), 1–15
T. ElGamal A public key cryptosystem and a signature scheme based on discrete logarithms, IEEE Transactions andInformation Theory, 31 (1985), 469–472
S. Flannery Cryptography:An investigation of a new algorithm vs. the RSA, http://cryptome.org/flannery-cp.pdf, 1999
T. W. Hungerford Algebra, Springer-Verlag
A. K. Lenstra, E. R. Verheul. The XTR public key system, Proc. Crypto 2000 (2000), 1–20
A. J. Menezes, P. C. Van Oorshot, S. A. Vanstone Handbook of applied cryptography, CRC press, 1997
R. Lidl, H. Niederreiter Introduction to finite fields and their application, Cambridge University press, 1986
K. H. Ko, S. J. Lee, J. H. Cheon, J. W. Han, J.-S. Kang, C. Park New public-key cryptosystem using braid groups, Proc. Crypto 2000 (2000), 166–184
N. Koblitz Elliptic curve crypto systems, Mathematics of Computation, 48 (1987), 203–209
V. Miller Use of elliptic curves in cryptography, Proc. Crypto 85 (1986), 417–426
K. Nyberg, R. Rueppel A new signature scheme based on DSA giving message recovery, 1st ACM Conference on Computer and Communications Security, (1993), 58–61
S.-H. Paeng, J.-W. Han, B. E. Jung “The security of XTR in view of the determinant”, preprint, 2001
S.-H. Paeng “A provably secure public key cryptosystem using finite non abelian groups”, preprint, 2001
S. C. Pohlig, M. E. Hellman An improved algorithm for computing logarithms over GF(p) and its cryptographic significance, IEEE Transactions on Information Theory, 23 (1978), 106–110
J. M. Pollard Monte Carlo methods for index computation (mod p), Mathematics of computation, 32 (1978), 918–924
R. L. Rivest, A. Shamir, L. M. Adleman A method for digital signature and public-key crypto systems, Communications of the ACM, 21 (1978), 120–126
A. Yamamura Public key cryptsystems using the modular group, PKC’98, 203–216
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Paeng, SH., Ha, KC., Kim, J.H., Chee, S., Park, C. (2001). New Public Key Cryptosystem Using Finite Non Abelian Groups. In: Kilian, J. (eds) Advances in Cryptology — CRYPTO 2001. CRYPTO 2001. Lecture Notes in Computer Science, vol 2139. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44647-8_28
Download citation
DOI: https://doi.org/10.1007/3-540-44647-8_28
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42456-7
Online ISBN: 978-3-540-44647-7
eBook Packages: Springer Book Archive