Anzeige
Erschienen in:
2006 | OriginalPaper | Buchkapitel
Towards Very Fast Modular Exponentiations Using Ant Colony
verfasst von : Nadia Nedjah, Luiza de Macedo Mourelle
Erschienen in: Applied Soft Computing Technologies: The Challenge of Complexity
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
The performance of public-key cryptosystems is primarily determined by the implementation efficiency of the modular multiplication and exponentiation. As the operands, i.e. the plain text of a message or the cipher (possibly a partially ciphered) text are usually large (1024 bits or more), and in order to improve time requirements of the encryption/decryption operations, it is essential to attempt to minimise the number of modular multiplications performed. In this paper, we exploit the ant colony’s principles to engineer a minimal addition chain that allows one to compute modular exponentiations very efficiently. The obtained results are compared to existing heuristics as well as to genetically evolved addition chains, i.e. using genetic algorithms.