Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
Linear cryptanalysis method for DES cipher
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
Foundations of Cryptography: Basic Tools
Foundations of Cryptography: Basic Tools
Cryptography: Theory and Practice
Cryptography: Theory and Practice
Differential-Linear Cryptanalysis
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
Modern Cryptography: Theory and Practice
Modern Cryptography: Theory and Practice
The design of S-boxes by simulated annealing
New Generation Computing - Evolutionary computation
Design of testable random bit generators
CHES'05 Proceedings of the 7th international conference on Cryptographic hardware and embedded systems
Enforcing the security of a time-bound hierarchical key assignment scheme
Information Sciences: an International Journal
Improved construction of nonlinear resilient S-boxes
IEEE Transactions on Information Theory
Improved lower bound on the number of balanced symmetric functions over GF(p)
Information Sciences: an International Journal
Studies on the distribution of the shortest linear recurring sequences
Information Sciences: an International Journal
A function-based user authority delegation model
Information Sciences: an International Journal
Hi-index | 0.07 |
In this study we propose a new design method for fast S-box construction. Its security is dependent upon the length of pseudorandom numbers generated by two communication parties. As the S-box is being built, we demonstrate that Boolean functions play an important role in the design of both block and stream ciphers. To satisfy a variety of cryptographic test methods, such as strict avalanche criterion (SAC), bit independence criterion (BIC), and nonlinearity, we apply polymorphic cipher (PMC) theory to the permutation function construction. Correlations among the test criteria in a real network environment are also evaluated.