TY - GEN
T1 - Finding minimal addition chains with a particle swarm optimization algorithm
AU - León-Javier, Alejandro
AU - Cruz-Cortés, Nareli
AU - Moreno-Armendáriz, Marco A.
AU - Orantes-Jiménez, Sandra
PY - 2009
Y1 - 2009
N2 - The addition chains with minimal length are the basic block to the optimal computation of finite field exponentiations. It has very important applications in the areas of error-correcting codes and cryptography. However, obtaining the shortest addition chains for a given exponent is a NP-hard problem. In this work we propose the adaptation of a Particle Swarm Optimization algorithm to deal with this problem. Our proposal is tested on several exponents whose addition chains are considered hard to find. We obtained very promising results.
AB - The addition chains with minimal length are the basic block to the optimal computation of finite field exponentiations. It has very important applications in the areas of error-correcting codes and cryptography. However, obtaining the shortest addition chains for a given exponent is a NP-hard problem. In this work we propose the adaptation of a Particle Swarm Optimization algorithm to deal with this problem. Our proposal is tested on several exponents whose addition chains are considered hard to find. We obtained very promising results.
UR - http://www.scopus.com/inward/record.url?scp=70549090120&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-05258-3_60
DO - 10.1007/978-3-642-05258-3_60
M3 - Contribución a la conferencia
SN - 3642052576
SN - 9783642052576
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 680
EP - 691
BT - MICAI 2009
T2 - 8th Mexican International Conference on Artificial Intelligence, MICAI 2009
Y2 - 9 November 2009 through 13 November 2009
ER -