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

DOI10.1007/978-3-540-45080-1_43MaRDI QIDQ4450926zbMATH OpenFDO

Authors Nadia Nedjah, Luiza de Macedo Mourelle

Publication date 16 February 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/2718/27180625.htm

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computing methodologies and applications (68U99)

Recommendations

• Minimal addition chain for efficient modular exponentiation using genetic algorithms
• scientific article; zbMATH DE number 2215630
• New modular multiplication algorithms for fast modular exponentiation
• Towards minimal addition chains using ant colony optimisation
• Efficient parallel modular exponentiation algorithm

Cited in

(3)

• Minimal addition chain for efficient modular exponentiation using genetic algorithms
• 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: Efficient pre-processing for large window-based modular exponentiation using genetic algorithms

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