메뉴 건너뛰기




Volumn 49, Issue 1, 2012, Pages 57-76

Short expressions of permutations as products and cryptanalysis of the Algebraic Eraser

Author keywords

Algebraic Eraser; Colored Burau Key Agreement Protocol (CBKAP); Expander; Expressions of permutations; Minimal Cycle Conjecture; Symmetric group

Indexed keywords

ALGEBRAIC ERASER; EXPANDER; EXPRESSIONS OF PERMUTATIONS; KEY AGREEMENT PROTOCOL; MINIMAL CYCLE CONJECTURE; SYMMETRIC GROUPS;

EID: 84861596547     PISSN: 01968858     EISSN: 10902074     Source Type: Journal    
DOI: 10.1016/j.aam.2012.03.001     Document Type: Article
Times cited : (16)

References (20)
  • 1
    • 0033245872 scopus 로고    scopus 로고
    • An algebraic method for public-key cryptography
    • I. Anshel, M. Anshel, and D. Goldfeld An algebraic method for public-key cryptography Math. Res. Lett. 6 1999 287 291
    • (1999) Math. Res. Lett. , vol.6 , pp. 287-291
    • Anshel, I.1    Anshel, M.2    Goldfeld, D.3
  • 4
    • 0001527133 scopus 로고
    • The probability of generating the symmetric group
    • L. Babai The probability of generating the symmetric group J. Combin. Theory Ser. A 52 1989 148 153
    • (1989) J. Combin. Theory Ser. A , vol.52 , pp. 148-153
    • Babai, L.1
  • 5
    • 1842538780 scopus 로고    scopus 로고
    • On the diameter of the symmetric group: Polynomial bounds
    • L. Babai, R. Beals, Á. Seress, On the diameter of the symmetric group: polynomial bounds, in: 15th ACM-SIAM SODA, 2004, pp. 1108-1112.
    • (2004) 15th ACM-SIAM SODA , pp. 1108-1112
    • L. Babai1
  • 6
    • 20744451398 scopus 로고    scopus 로고
    • Near-independence of permutations and an almost sure polynomial bound on the diameter of the symmetric group
    • Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms
    • L. Babai, T. Hayes, Near-independence of permutations and an almost sure polynomial bound on the diameter of the symmetric group, in: 16th ACM-SIAM SODA, 2005, pp. 1057-1066. (Pubitemid 40851473)
    • (2005) Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms , pp. 1057-1066
    • Babai, L.1    Hayes, T.P.2
  • 10
    • 0000660463 scopus 로고
    • The probability of generating the symmetric group
    • J. Dixon The probability of generating the symmetric group Math. Z. 110 1969 199 205
    • (1969) Math. Z. , vol.110 , pp. 199-205
    • Dixon, J.1
  • 11
    • 27844553483 scopus 로고    scopus 로고
    • Asymptotics of generating the symmetric and alternating groups
    • J. Dixon Asymptotics of generating the symmetric and alternating groups Electron. J. Combin. 12 2005 R56
    • (2005) Electron. J. Combin. , vol.12 , pp. 56
    • Dixon, J.1
  • 16
    • 84974622583 scopus 로고    scopus 로고
    • New public-key cryptosystem using braid groups
    • Lecture Notes in Comput. Sci.
    • K. Ko, S. Lee, J. Cheon, J. Han, S. Kang, and C. Park New public-key cryptosystem using braid groups CRYPTO 2000 Lecture Notes in Comput. Sci. vol. 1880 2000 166 183
    • (2000) CRYPTO 2000 , vol.1880 VOL. , pp. 166-183
    • Ko, K.1    Lee, S.2    Cheon, J.3    Han, J.4    Kang, S.5    Park, C.6
  • 17
    • 0032119334 scopus 로고    scopus 로고
    • An algorithm for solving the factorization problem in permutation groups
    • T. Minkwitz An algorithm for solving the factorization problem in permutation groups J. Symbolic Comput. 26 1998 89 95 (Pubitemid 128179471)
    • (1998) Journal of Symbolic Computation , vol.26 , Issue.1 , pp. 89-95
    • Minkwitz, T.1
  • 18
    • 0000258731 scopus 로고    scopus 로고
    • The multivariate Alexandrov polynomial for a closed braid
    • H. Morton The multivariate Alexandrov polynomial for a closed braid Contemp. Math. 233 1999 167 172
    • (1999) Contemp. Math. , vol.233 , pp. 167-172
    • Morton, H.1
  • 19
    • 0037634263 scopus 로고
    • Seifert fibre spaces and braid groups
    • K. Murasugi Seifert fibre spaces and braid groups Proc. Lond. Math. Soc. 44 1982 71 84
    • (1982) Proc. Lond. Math. Soc. , vol.44 , pp. 71-84
    • Murasugi, K.1
  • 20
    • 84858390356 scopus 로고    scopus 로고
    • Cryptanalysis of the Anshel-Anshel-Goldfeld-Lemieux Key Agreement Protocol
    • A. Myasnikov, and A. Ushakov Cryptanalysis of the Anshel-Anshel-Goldfeld- Lemieux Key Agreement Protocol Groups Complex. Cryptol. 1 2009 63 75 arXiv:0801.4786
    • (2009) Groups Complex. Cryptol. , vol.1 , pp. 63-75
    • Myasnikov, A.1    Ushakov, A.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.