메뉴 건너뛰기




Volumn 1, Issue 1, 2009, Pages 63-75

Cryptanalysis of the Anshel-Anshel-Goldfeld-Lemieux key agreement protocol

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; CRYPTOGRAPHY; RADIO FREQUENCY IDENTIFICATION (RFID);

EID: 84858390356     PISSN: 18671144     EISSN: 18696104     Source Type: Journal    
DOI: 10.1515/GCC.2009.63     Document Type: Article
Times cited : (13)

References (10)
  • 3
    • 0000906878 scopus 로고    scopus 로고
    • A fast method for comparing braids
    • DOI 10.1006/aima.1997.1605, PII S0001870897916054
    • P. Dehornoy: A fast method for comparing braids, Adv. Math. 125(1997) 200-235. (Pubitemid 127341271)
    • (1997) Advances in Mathematics , vol.125 , Issue.2 , pp. 200-235
    • Dehornoy, P.1
  • 4
    • 38049095404 scopus 로고    scopus 로고
    • Length-based conjugacy search in the braid group
    • L. Gerritzen et al. ed., Contemp. Math, AMS, Providence
    • D. Garber, S. Kaplan, M. Teicher, B. Tsaban, U. Vishne: Length-based conjugacy search in the braid group, in: Algebraic Methods in Cryptography, L. Gerritzen et al. (ed.), Contemp. Math. 418, AMS, Providence (2006) 1-34.
    • (2006) Algebraic Methods in Cryptography , vol.418 , pp. 1-34
    • Garber, D.1    Kaplan, S.2    Teicher, M.3    Tsaban, B.4    Vishne, U.5
  • 9
    • 38049061060 scopus 로고    scopus 로고
    • Length based attack and braid groups: Cryptanalysis of Ahsel-Anshel-Goldfeld key exchange protocol
    • PKC, Beijing, 2007, T. Okamoto et al. ed., Lect. Notes Comput. Sci, Springer, Berlin
    • A. D. Myasnikov, A. Ushakov: Length based attack and braid groups: cryptanalysis of Ahsel-Anshel-Goldfeld key exchange protocol, in: Public Key Cryptography (PKC, Beijing, 2007), T. Okamoto et al. (ed.), Lect. Notes Comput. Sci. 4450, Springer, Berlin (2007) 76-88.
    • (2007) Public Key Cryptography , vol.4450 , pp. 76-88
    • Myasnikov, A.D.1    Ushakov, A.2
  • 10
    • 0000813451 scopus 로고
    • The set of minimal braids is co-NP-complete
    • M. Paterson, A. Razborov: The set of minimal braids is co-NP-complete, J. Algorithms 12(1991) 393-408.
    • (1991) J. Algorithms , vol.12 , pp. 393-408
    • Paterson, M.1    Razborov, A.2


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