Differentially uniform mappings for cryptography
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
Almost perfect nonlinear power functions on GF (2n): the Niho case
Information and Computation
Codes, Bent Functions and Permutations Suitable For DES-likeCryptosystems
Designs, Codes and Cryptography
SIAM Journal on Discrete Mathematics
Hyperplane Sections of Fermat Varieties in P3 in Char.2 and Some Applications to Cyclic Codes
AAECC-10 Proceedings of the 10th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Towards Sound Approaches to Counteract Power-Analysis Attacks
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems
CRYPTO '96 Proceedings of the 16th Annual International Cryptology Conference on Advances in Cryptology
DES and Differential Power Analysis (The "Duplication" Method)
CHES '99 Proceedings of the First International Workshop on Cryptographic Hardware and Embedded Systems
Power Analysis Attacks of Modular Exponentiation in Smartcards
CHES '99 Proceedings of the First International Workshop on Cryptographic Hardware and Embedded Systems
On Boolean and Arithmetic Masking against Differential Power Analysis
CHES '00 Proceedings of the Second International Workshop on Cryptographic Hardware and Embedded Systems
Smartly Analyzing the Simplicity and the Power of Simple Power Analysis on Smartcards
CHES '00 Proceedings of the Second International Workshop on Cryptographic Hardware and Embedded Systems
Differential Power Analysis in the Presence of Hardware Countermeasures
CHES '00 Proceedings of the Second International Workshop on Cryptographic Hardware and Embedded Systems
CHES '00 Proceedings of the Second International Workshop on Cryptographic Hardware and Embedded Systems
Multiplicative Masking and Power Analysis of AES
CHES '02 Revised Papers from the 4th International Workshop on Cryptographic Hardware and Embedded Systems
Simplified Adaptive Multiplicative Masking for AES
CHES '02 Revised Papers from the 4th International Workshop on Cryptographic Hardware and Embedded Systems
On the construction of highly nonlinear permutations
EUROCRYPT'92 Proceedings of the 11th annual international conference on Theory and application of cryptographic techniques
FSE'05 Proceedings of the 12th international conference on Fast Software Encryption
Almost perfect nonlinear power functions on GF(2n): the Welch case
IEEE Transactions on Information Theory
Binary m-sequences with three-valued crosscorrelation: a proof of Welch's conjecture
IEEE Transactions on Information Theory
A Proof of the Welch and Niho Conjectures on Cross-Correlations of Binary m-Sequences
Finite Fields and Their Applications
CAR30: A new scalable stream cipher with rule 30
Cryptography and Communications
On using genetic algorithms for intrinsic side-channel resistance: the case of AES S-box
Proceedings of the First Workshop on Cryptography and Security in Computing Systems
| Hi-index | 0.01 |
Prouff has introduced recently, at FSE 2005, the notion of transparency order of S-boxes. This new characteristic is related to the ability of an S-box, used in a cryptosystem in which the round keys are introduced by addition, to thwart single-bit or multi-bit DPA attacks on the system. If this parameter has sufficiently small value, then the S-box is able to withstand DPA attacks without that ad-hoc modifications in the implementation be necessary (these modifications make the encryption about twice slower). We prove a lower bound on the transparency order of highly nonlinear S-boxes. We show that some highly nonlinear functions, and in particular the S-box of AES, have very bad transparency orders.