메뉴 건너뛰기




Volumn 26, Issue 4, 2013, Pages 559-637

Erratum: A comparison of cryptanalytic tradeoff algorithms (J. Cryptol. (DOI 10.1007/s00145-012-9128-3));A comparison of cryptanalytic tradeoff algorithms

Author keywords

Distinguished point; Hellman; Rainbow table; Time memory tradeoff

Indexed keywords

CRYPTOGRAPHY;

EID: 84890439294     PISSN: 09332790     EISSN: 14321378     Source Type: Journal    
DOI: 10.1007/s00145-012-9140-7     Document Type: Erratum
Times cited : (26)

References (28)
  • 1
    • 49449086865 scopus 로고    scopus 로고
    • Characterization and improvement of time-memory trade-off based on perfect tables
    • 10.1145/1380564.1380565 Preliminary version in INDOCRYPT 2005
    • G. Avoine, P. Junod, P. Oechslin, Characterization and improvement of time-memory trade-off based on perfect tables. ACM Trans. Inf. Syst. Secur. 11(4), 17:1-17:22 (2008). Preliminary version in INDOCRYPT 2005
    • (2008) ACM Trans. Inf. Syst. Secur. , vol.11 , Issue.4 , pp. 171-1722
    • Avoine, G.1    Junod, P.2    Oechslin, P.3
  • 2
    • 0029218160 scopus 로고
    • Improved exhaustive search attacks on stream ciphers
    • IEE Conference Publication 408 IEE London 10.1049/cp:19950490
    • S.H. Babbage, Improved exhaustive search attacks on stream ciphers, in European Convention on Security and Detection. IEE Conference Publication, vol. 408 (IEE, London, 1995), pp. 161-166
    • (1995) European Convention on Security and Detection , pp. 161-166
    • Babbage, S.H.1
  • 4
    • 33749576843 scopus 로고    scopus 로고
    • Rigorous bounds on cryptanalytic time/memory tradeoffs
    • LNCS 4117 Springer Berlin 10.1007/11818175-1
    • E. Barkan, E. Biham, A. Shamir, Rigorous bounds on cryptanalytic time/memory tradeoffs, in Advances in Cryptology - CRYPTO 2006. LNCS, vol. 4117 (Springer, Berlin, 2006), pp. 1-21
    • (2006) Advances in Cryptology - CRYPTO 2006 , pp. 1-21
    • Barkan, E.1    Biham, E.2    Shamir, A.3
  • 5
    • 84937419430 scopus 로고    scopus 로고
    • Cryptanalytic time/memory/data tradeoffs for stream ciphers
    • LNCS 1976 Springer Berlin 10.1007/3-540-44448-3-1
    • A. Biryukov, A. Shamir, Cryptanalytic time/memory/data tradeoffs for stream ciphers, in Advances in Cryptology - ASIACRYPT 2000. LNCS, vol. 1976 (Springer, Berlin, 2000), pp. 1-13
    • (2000) Advances in Cryptology - ASIACRYPT 2000 , pp. 1-13
    • Biryukov, A.1    Shamir, A.2
  • 6
    • 84974707207 scopus 로고    scopus 로고
    • Real time cryptanalysis of A5/1 on a PC
    • LNCS 1978 Springer Berlin
    • A. Biryukov, A. Shamir, D. Wagner, Real time cryptanalysis of A5/1 on a PC, in FSE 2000. LNCS, vol. 1978 (Springer, Berlin, 2001), pp. 1-18
    • (2001) FSE 2000 , pp. 1-18
    • Biryukov, A.1    Shamir, A.2    Wagner, D.3
  • 13
    • 84957381006 scopus 로고    scopus 로고
    • Cryptanalysis of alleged A5 stream cipher
    • LNCS 1233 Springer Berlin
    • J.Dj. Golić, Cryptanalysis of alleged A5 stream cipher, in Advances in Cryptology - EUROCRYPT'97. LNCS, vol. 1233 (Springer, Berlin, 1997), pp. 239-255
    • (1997) Advances in Cryptology - EUROCRYPT'97 , pp. 239-255
    • Golić, J.Dj.1
  • 14
    • 0019038335 scopus 로고
    • A cryptanalytic time-memory trade-off
    • 581786 0436.94016 10.1109/TIT.1980.1056220
    • M.E. Hellman, A cryptanalytic time-memory trade-off. IEEE Trans. Inf. Theory 26, 401-406 (1980)
    • (1980) IEEE Trans. Inf. Theory , vol.26 , pp. 401-406
    • Hellman, M.E.1
  • 15
    • 77956876380 scopus 로고    scopus 로고
    • The cost of false alarms in Hellman and rainbow tradeoffs
    • 2679150 1197.94192 10.1007/s10623-010-9368-x
    • J. Hong, The cost of false alarms in Hellman and rainbow tradeoffs. Des. Codes Cryptogr. 57, 293-327 (2010)
    • (2010) Des. Codes Cryptogr. , vol.57 , pp. 293-327
    • Hong, J.1
  • 17
    • 0032680924 scopus 로고    scopus 로고
    • Achieving higher success probability in time-memory trade-off cryptanalysis without increasing memory size
    • I.-J. Kim, T. Matsumoto, Achieving higher success probability in time-memory trade-off cryptanalysis without increasing memory size. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. E82-A, 123-129 (1999)
    • (1999) IEICE Trans. Fundam. Electron. Commun. Comput. Sci. , vol.82 , pp. 123-129
    • Kim, I.-J.1    Matsumoto, T.2
  • 18
    • 0029733777 scopus 로고    scopus 로고
    • Optimization of time-memory trade-off cryptanalysis and its application to DES, FEAL-32, and Skipjack
    • K. Kusuda, T. Matsumoto, Optimization of time-memory trade-off cryptanalysis and its application to DES, FEAL-32, and Skipjack. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 79(1), 35-48 (1996)
    • (1996) IEICE Trans. Fundam. Electron. Commun. Comput. Sci. , vol.79 , Issue.1 , pp. 35-48
    • Kusuda, K.1    Matsumoto, T.2
  • 19
    • 59349085504 scopus 로고    scopus 로고
    • Success probability of the Hellman trade-off
    • 2498331 1191.68282 10.1016/j.ipl.2008.12.002
    • D. Ma, J. Hong, Success probability of the Hellman trade-off. Inf. Process. Lett. 109(7), 347-351 (2009)
    • (2009) Inf. Process. Lett. , vol.109 , Issue.7 , pp. 347-351
    • Ma, D.1    Hong, J.2
  • 22
    • 33745788833 scopus 로고    scopus 로고
    • Fast dictionary attacks on passwords using time-space tradeoff
    • ACM New York
    • A. Narayanan, V. Shmatikov, Fast dictionary attacks on passwords using time-space tradeoff, in Proceedings of the 12th ACM CCS (ACM, New York, 2005), pp. 364-372
    • (2005) Proceedings of the 12th ACM CCS , pp. 364-372
    • Narayanan, A.1    Shmatikov, V.2
  • 23
    • 35248858454 scopus 로고    scopus 로고
    • Making a faster cryptanalytic time-memory trade-off
    • LNCS 2729 Springer Berlin 10.1007/978-3-540-45146-4-36
    • P. Oechslin, Making a faster cryptanalytic time-memory trade-off, in Advances in Cryptology - CRYPTO 2003. LNCS, vol. 2729 (Springer, Berlin, 2003), pp. 617-630
    • (2003) Advances in Cryptology - CRYPTO 2003 , pp. 617-630
    • Oechslin, P.1
  • 27
    • 70349669575 scopus 로고    scopus 로고
    • Choosing parameters to achieve a higher success rate for Hellman time memory trade off attack
    • IEEE New York 10.1109/ARES.2009.140
    • N. Saran, A. Doganaksoy, Choosing parameters to achieve a higher success rate for Hellman time memory trade off attack, in 2009 International Conference on Availability, Reliability and Security (IEEE, New York, 2009), pp. 504-509
    • (2009) 2009 International Conference on Availability, Reliability and Security , pp. 504-509
    • Saran, N.1    Doganaksoy, A.2


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