Compilers: principles, techniques, and tools
Compilers: principles, techniques, and tools
Genetic programming (videotape): the movie
Genetic programming (videotape): the movie
A survey of fast exponentiation methods
Journal of Algorithms
Practical genetic algorithms
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
Handbook of Applied Cryptography
Handbook of Applied Cryptography
Introduction to Digital Systems
Introduction to Digital Systems
Principles in the Evolutionary Design of Digital Circuits—Part I
Genetic Programming and Evolvable Machines
A Survey of Hardware Implementation of RSA (Abstract)
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Power Analysis Attacks of Modular Exponentiation in Smartcards
CHES '99 Proceedings of the First International Workshop on Cryptographic Hardware and Embedded Systems
Montgomery Modular Exponentiation on Reconfigurable Hardware
ARITH '99 Proceedings of the 14th IEEE Symposium on Computer Arithmetic
DSD '02 Proceedings of the Euromicro Symposium on Digital Systems Design
Two Hardware Implementations for the Montgomery Modular Multiplication: Sequential versus Parallel
Proceedings of the 15th symposium on Integrated circuits and systems design
An overview of evolutionary algorithms in multiobjective optimization
Evolutionary Computation
Extending Quine-McCluskey for Exclusive-Or logic synthesis
IEEE Transactions on Education
Hi-index | 0.00 |
In this paper genetic programming is used as an alternative means to automatically generate secure and minimal hardware designs of public-key cryptosystems such as the RSA cryptosystem. We evolve optimal hardware circuits for modular exponentiation, which is a cornerstone operation in many public-key cryptographic system. The evolved circuits minimize both space(i.e. required gate number) and time (i.e. encryption and decryption time). The evolved designs are shielded against side-channel leakage and hence secure. The structure of the cryptographic circuit is random and so the private key cannot be deduced using known attacks. We compare our results against existing well-known designs, which were produced by human designers based on the binary method.