![]() “Correlations in RC6 with a reduced number of rounds.” Proceedings of Fast Software Encryption-FSE 2000, Lecture Notes in Computer Science, vol. “A chosen-plaintext linear attack on DES.” Fast Software Encryption, FSE 2000, Lecture Notes in Computer Science, vol. “New method for upper bounding the maximum average linear hull probability for SPNs.” EUROCRYPT 2001, Lecture Notes in Computer Science, vol. “Linear cryptanalysis using multiple approximations.” Advances in Cryptography-CRYPTO'94, Lecture Notes in Computer Science, vol. “Optimal key ranking procedures in a statistical cryptanalysis.” Fast Software Encryption, FSE 2003, Lecture Notes in Computer Science, vol. “Provable security against differential and linear cryptanalysis for the SPN structure.” Proceedings of Fast Software Encryption-FSE 2000, Lecture Notes in Computer Science, vol. “Partitioning cryptanalysis.” Fast Software Encryption, FSE'97, Lecture Notes in Computer Science, vol. Advances in Cryptology-CRYPTO'94, Lecture Notes in Computer Science, vol. “On Multiple Linear Approximations", Advances in Cryptology, proceedings of CRYPTO 2004, Lecture Notes in Computer Science 3152, ed. “On Matsui's linear cryptanalysis.” Advances in Cryptology-EUROCRYRT'94, Lecture Notes in Computer Science, vol. Sections “Piling-up Lemma,” to “Provable security against linear cryptanalysis” discuss a.īiham, E. The next section provides some more details about the attack algorithm. Using auxiliary techniques he can usually extend the attack to find more bits of the secret key. Given an approximation with high probability, the attacker obtains an estimate for the parity bit of the secret key by analyzing the parity bits of the known plaintexts and ciphertexts. Linear cryptanalysis is a known plaintext attack in which the attacker studies probabilistic linear relations (called linear approximations) between parity bits of the plaintext, the ciphertext, and the secret key. The attack in its current form was first applied to the Data Encryption Standard (DES), but an early variant of linear cryptanalysis, developed by Matsui and Yamagishi, was already successfully used to attack FEAL in 1992. Linear cryptanalysis is a powerful method of cryptanalysis of block ciphers introduced by Matsui in 1993.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |