Differentially uniform mappings for cryptography
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
Two new classes of bent functions
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
Linear cryptanalysis method for DES cipher
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
Codes, Bent Functions and Permutations Suitable For DES-likeCryptosystems
Designs, Codes and Cryptography
Strenght of MISTY1 without FL Function for Higher Order Differential Attack
AAECC-13 Proceedings of the 13th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
On MISTY1 Higher Order Differential Cryptanalysis
ICISC '00 Proceedings of the Third International Conference on Information Security and Cryptology
Provable Security Against Differential Cryptanalysis
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
The First Experimental Cryptanalysis of the Data Encryption Standard
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
New Block Encryption Algorithm MISTY
FSE '97 Proceedings of the 4th International Workshop on Fast Software Encryption
The Interpolation Attack on Block Ciphers
FSE '97 Proceedings of the 4th International Workshop on Fast Software Encryption
A New Characterization of Almost Bent Functions
FSE '99 Proceedings of the 6th International Workshop on Fast Software Encryption
On the construction of highly nonlinear permutations
EUROCRYPT'92 Proceedings of the 11th annual international conference on Theory and application of cryptographic techniques
Some new three-valued crosscorrelation functions for binary m-sequences
IEEE Transactions on Information Theory
A Larger Class of Cryptographic Boolean Functions via a Study of the Maiorana-McFarland Construction
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
Cryptanalysis of Block Ciphers with Overdefined Systems of Equations
ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Journal of Complexity - Special issue on coding and cryptography
New construction of resilient functions with satisfying multiple cryptographic criteria
InfoSecu '04 Proceedings of the 3rd international conference on Information security
Concatenating Indicators of Flats for Designing Cryptographic Functions
Designs, Codes and Cryptography
Aperiodic propagation criteria for Boolean functions
Information and Computation
Aperiodic propagation criteria for Boolean functions
Information and Computation
Differential properties of power functions
International Journal of Information and Coding Theory
Zero-sum distinguishers for iterated permutations and application to KECCAK-f and Hamsi-256
SAC'10 Proceedings of the 17th international conference on Selected areas in cryptography
Higher-order differential properties of KECCAK and Luffa
FSE'11 Proceedings of the 18th international conference on Fast software encryption
Efficient representation and software implementation of resilient maiorana-mcfarland s-boxes
WISA'04 Proceedings of the 5th international conference on Information Security Applications
General principles of algebraic attacks and new design criteria for cipher components
AES'04 Proceedings of the 4th international conference on Advanced Encryption Standard
The inverse s-box, non-linear polynomial relations and cryptanalysis of block ciphers
AES'04 Proceedings of the 4th international conference on Advanced Encryption Standard
On exact algebraic [non-]immunity of s-boxes based on power functions
ACISP'06 Proceedings of the 11th Australasian conference on Information Security and Privacy
Probabilistic algebraic attacks
IMA'05 Proceedings of the 10th international conference on Cryptography and Coding
EPCBC: a block cipher suitable for electronic product code encryption
CANS'11 Proceedings of the 10th international conference on Cryptology and Network Security
| Hi-index | 0.00 |
To improve the security of iterated block ciphers, the resistance against linear cryptanalysis has been formulated in terms of provable security which suggests the use of highly nonlinear functions as round functions. Here, we show that some properties of such functions enable to find a new upper bound for the degree of the product of its Boolean components. Such an improvement holds when all values occurring in the Walsh spectrum of the round function are divisible bya high power of 2. This result leads to a higher order differential attack on any 5-round Feistel ciphers using an almost bent substitution function. We also show that the use of such a function is precisely the origin of the weakness of a reduced version of MISTY1 reported in [23, 1].