论文信息 - Weak Keys in MST 1

Weak Keys in MST 1

The public key cryptosystem MST1 has been introduced in [9]. Its security relies on the hardness of factoring with respect to wild logarithmic signatures. To identify ‘wild-like’ logarithmic signatures, the criterion of being totally-non-transversal has been proposed. We give tame totally-non-transversal logarithmic signatures for the alternating and symmetric groups of degree ≥ 5. Hence, basing a key generation procedure on the assumption that totally-non-transversal logarithmic signatures are ‘wild like’ seems critical. We also discuss the problem of recognizing ‘weak’ totally-non-transversal logarithmic signatures, and demonstrate that another proposed key generation procedure based on permutably transversal logarithmic signatures may produce weak keys.

Rainer Steinwandt | Jens-Matthias Bohli | Maŕıa Isabel González Vasco | Consuelo Mart́ınez

[1] Spyros S. Magliveras,et al. Group factorizations in cryptography , 2000 .

[2] Jung Hee Cheon,et al. New Public-Key Cryptosystem Using Braid Groups , 2000, CRYPTO.

[3] John J. Cannon,et al. The Magma Algebra System I: The User Language , 1997, J. Symb. Comput..

[4] Choonsik Park,et al. New Public Key Cryptosystem Using Finite Non Abelian Groups , 2001, CRYPTO.

[5] Daesung Kwon,et al. Improved Public Key Cryptosystem using Finite non Abelian Groups , 2001, IACR Cryptol. ePrint Arch..

[6] Thomas de Quincey. [C] , 2000, The Works of Thomas De Quincey, Vol. 1: Writings, 1799–1820.

[7] Peter W. Shor,et al. Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer , 1995, SIAM Rev..

[8] Rainer Steinwandt,et al. Towards a Uniform Description of Several Group Based Cryptographic Primitives , 2004, Des. Codes Cryptogr..

[9] M. I. Gonz. Secret-and Public-key Cryptosystems from Group Factorizations , .

[10] Douglas R. Stinson,et al. New Approaches to Designing Public Key Cryptosystems Using One-Way Functions and Trapdoors in Finite Groups , 2001, Journal of Cryptology.