Finding short and implementation-friendly addition chains with evolutionary algorithms
Finding the shortest addition chain for a given exponent is a significant problem in cryptography. In this work, we present a genetic algorithm with a novel encoding of solutions and new crossover and mutation operators to minimize the length of the addition chains corresponding to a given exponent....
Main Authors: | , , , , |
---|---|
Other Authors: | |
Format: | Article |
Language: | English |
Published: |
Springer-Verlag,
2018-05-30T15:43:44Z.
|
Subjects: | |
Online Access: | Get fulltext |