Minimal addition chain for efficient modular exponentiation using genetic algorithms

DOI10.1007/3-540-48035-8_10MaRDI QIDQ3047708zbMATH OpenFDO

Authors Nadia Nedjah, Luiza de Macedo Mourelle

Publication date 12 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2358/23580088.htm

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computing methodologies and applications (68U99) Cryptography (94A60)

Recommendations

• Efficient pre-processing for large window-based modular exponentiation using genetic algorithms
• Towards minimal addition chains using ant colony optimisation
• Efficient parallel modular exponentiation algorithm
• Minimal addition-subtraction chains using genetic algorithms
• Stochastic Algorithms: Foundations and Applications

Cited in

(5)

• Minimal addition-subtraction chains using genetic algorithms
• Efficient pre-processing for large window-based modular exponentiation using genetic algorithms
• Stochastic Algorithms: Foundations and Applications
• scientific article; zbMATH DE number 2215630 (Why is no real title available?)
• Towards minimal addition chains using ant colony optimisation

This page was built for publication: Minimal addition chain for efficient modular exponentiation using genetic algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3047708)