Advances in Cryptology – CRYPTO 2004

DOI10.1007/b99099zbMath1104.94308OpenAlexW2477011922WikidataQ27980744 ScholiaQ27980744MaRDI QIDQ5311541

Nicolas T. Courtois

Publication date: 23 August 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b99099

zbMATH Keywords

DESlinear cryptanalysisBlock ciphersmultivariate quadratic equationsS-box designFeistel schemescorrelation attacks on block ciphersgeneralised linear cryptanalysisI/O sumsinverse-based S-box

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (8)

Can a differential attack work for an arbitrarily large number of rounds? ⋮ SEA: A Scalable Encryption Algorithm for Small Embedded Applications ⋮ On degree-\(d\) zero-sum sets of full rank ⋮ Upper estimates of imbalance of bilinear approximations for round functions of block ciphers ⋮ Non-asymptotic lower bounds for the data complexity of statistical attacks on symmetric cryptosystems ⋮ Unnamed Item ⋮ Determining whether a given cryptographic function is a permutation of another given cryptographic function -- a problem in intellectual property ⋮ On weak rotors, Latin squares, linear algebraic representations, invariant differentials and cryptanalysis of Enigma

This page was built for publication: Advances in Cryptology – CRYPTO 2004