Abstract
In this paper we introduce the notion of impossible fault analysis, and present an impossible fault analysis of RC4, whose complexity 221 is smaller than the previously best known attack of Hoch and Shamir (2 26), along with an even faster fault analysis of RC4, based on different ideas, with complexity smaller than 216. © International Association for Cryptologic Research 2005.
Cite
CITATION STYLE
Biham, E., Granboulan, L., & Nguyễn, P. Q. (2005). Impossible fault analysis of RC4 and differential fault analysis of RC4. In Lecture Notes in Computer Science (Vol. 3557, pp. 359–367). Springer Verlag. https://doi.org/10.1007/11502760_24
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.