Facebook Instagram Twitter RSS Feed PodBean Back to top on side

Secret- and public-key cryptosystems from group factorizations

In: Tatra Mountains Mathematical Publications, vol. 25, no. 3
Spyros S. Magliveras
Detaily:
Rok, strany: 2002, 11 - 22
O článku:
Many known cryptosystems, symmetric or asymmetric, have been based on properties of large abelian groups. Here we discuss cryptosystems based on non-abelian, in fact non-solvable groups. A symmetric key cryptosystem based on logarithmic signatures for finite permutation groups was proposed by the author in [S. S. Magliveras: A cryptosystem from logarithmic signatures of finite groups, In Proceedings of the 29'th Midwest Symposium on Circuits and Systems, Elsevier Publishing Company, (1986), pp. 972–975], and its algebraic properties were studied in [S. S. Magliveras, N. D. Memon: The Algebraic Properties of Cryptosystem PGM, J. of Cryptology, 5 (1992), 167–183]. Moreover, two possible approaches to the construction of new public key cryptosystems using group factorizations were described in [S. S. Magliveras, Tran Van Trung and D. R. Stinson: t New approaches to designing public key cryptosystems using one-way functions and trap-doors in finite groups, to appear in the J. Cryptology]. We discuss the above systems, issues related to them, and provide some insight into a question posed by M. I. González Vasco and R. Steinwaldt.
Ako citovať:
ISO 690:
Magliveras, S. 2002. Secret- and public-key cryptosystems from group factorizations. In Tatra Mountains Mathematical Publications, vol. 25, no.3, pp. 11-22. 1210-3195.

APA:
Magliveras, S. (2002). Secret- and public-key cryptosystems from group factorizations. Tatra Mountains Mathematical Publications, 25(3), 11-22. 1210-3195.