Identyfikatory
Warianty tytułu
Języki publikacji
Abstrakty
Generators of finite cyclic groups play important role in many cryptographic algorithms like public key ciphers, digital signatures, entity identification and key agreement algorithms. The above kinds of cryptographic algorithms are crucial for all secure communication in computer networks and secure information processing (in particular in mobile services, banking and electronic administration). In the paper, proofs of correctness of two probabilistic algorithms (for finding generators of finite cyclic groups and primitive roots) are given along with assessment of their average time computational complexity.
Rocznik
Tom
Strony
989--996
Opis fizyczny
Bibliogr. 9 poz., rys.
Twórcy
autor
- Institute of Electronic Systems, Warsaw University of Technology, 15/19 Nowowiejska St., 00-662 Warsaw, Poland
autor
- Institute of Mathematical Machines, 34 Krzywickiego St., 02-078 Warsaw, Poland
Bibliografia
- [1] V. Shoup, A Computational Introduction to Number Theory and Algebra, University Press, Cambridge, 2008.
- [2] N. Koblitz, A Course in Number Theory and Cryptography, Springer, New York, 1994.
- [3] C. Bagiński, Introduction to Group Theory, SCRIPT, Warszawa, 2002, (in Polish).
- [4] W. Narkiewicz, Number Theory, PWN,Warszawa, 1990, (in Polish).
- [5] A. Menezes, P. Oorschot, and S. Vanstone, Handbook of Applied Cryptography, CRC Press Inc., London, 1997, (http://cacr.math.uwaterloo.ca/hac).
- [6] D. Hankerson, A. Menezes, and S. Vanstone, Guide to Elliptic Curve Cryptography, Springer, New York, 2004.
- [7] S. Yan, Number Theory for Computing, Springer, Berlin, 2002.
- [8] J. Pieprzyk, T. Hardjono, and J. Seberry, Fundamentals of Computer Security, Springer, Berlin, 2003.
- [9] A. Białynicki-Birula, Algebra, PWN, Warszawa 2009, (in Polish).
Typ dokumentu
Bibliografia
Identyfikator YADDA
bwmeta1.element.baztech-c3640c3d-1817-4acf-b401-7a57b8742dc8