Improved Cryptanalysis of Polar Bear
2006 (English)Conference paper (Refereed)
In this paper we propose a Guess-and-Determine based initial state recovery attack on Polar Bear, one of the ECRYPT stream cipher project candi-dates. The computational complexity and success probability of our attack are O(231) and 2-26.4 respectively. Our attack can be considered as one with compu-tational complexity of O(257.4) which is much better than the attack recently proposed by J. Mattsson with computational complexity of O(279).
Place, publisher, year, edition, pages
2006. 154-160 p.
Stream Cipher, Guess-and-Determine Attack, Polar Bear, ECRYPT, Security Evaluation.
IdentifiersURN: urn:nbn:se:kth:diva-71073OAI: oai:DiVA.org:kth-71073DiVA: diva2:486495
In State of Art of Stream Ciphers (SASC’06)
QC 201202012012-01-302012-01-302012-02-01Bibliographically approved