Minimal Addition Chain for Efficient Modular Exponentiation Using Genetic Algorithms

Authors:
Nadia Nedjah;Luiza de Macedo Mourelle
Affiliations:
-;-
Venue:
IEA/AIE '02 Proceedings of the 15th international conference on Industrial and engineering applications of artificial intelligence and expert systems: developments in applied artificial intelligence
Year:
2002

Citing 5
Cited 3

Genetic algorithms + data structures = evolution programs (3rd ed.)

Genetic algorithms + data structures = evolution programs (3rd ed.)
Practical genetic algorithms

Practical genetic algorithms
A method for obtaining digital signatures and public-key cryptosystems

Communications of the ACM
Using Genetic Algorithms to Solve NP-Complete Problems

Proceedings of the 3rd International Conference on Genetic Algorithms
An Analysis of the Interacting Roles of Population Size and Crossover in Genetic Algorithms

PPSN I Proceedings of the 1st Workshop on Parallel Problem Solving from Nature

Efficient pre-processing for large window-based modular exponentiation using genetic algorithms

IEA/AIE'2003 Proceedings of the 16th international conference on Developments in applied artificial intelligence
Efficient and secure cryptographic systems based on addition chains: hardware design vs. software/hardware co-design

Integration, the VLSI Journal - Special issue: Embedded cryptographic hardware
A simulated annealing algorithm for the problem of minimal addition chains

EPIA'11 Proceedings of the 15th Portugese conference on Progress in artificial intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

Modular exponentiation is fundamental to several public-key cryptography systems such as the RSA encryption system. It is performed using successive modular multiplication. The latter operation is time consuming for large operands. Accelerating public-key cryptography software or hardware needs either optimising the time consumed by a single modular multiplication or reducing the total number of modular multiplication performed or both of them. This paper introduces a novel idea based on genetic algorithms for computing an optimal addition chain that allows us to minimise the number of modular multiplication and hence implementing efficiently the modular exponentiation.