Montgomery-friendly primes and applications to cryptography
- 5 April 2021
- journal article
- research article
- Published by Springer Nature in Journal of Cryptographic Engineering
- Vol. 11 (4) , 399-415
Abstract
No abstract availableKeywords
Funding Information
- Agence Nationale de la Recherche (ANR-15-CE39-0002)
This publication has 35 references indexed in Scilit:
- Fast Cryptography in Genus 2Lecture Notes in Computer Science, 2013
- FPGA Implementation of Pairings Using Residue Number System and Lazy ReductionLecture Notes in Computer Science, 2011
- A One Round Protocol for Tripartite Diffie–HellmanJournal of Cryptology, 2004
- Use of Elliptic Curves in Cryptography2000
- Cox-Rower Architecture for Fast Parallel Montgomery Multiplication2000
- Modulo reduction in residue number systemsIEEE Transactions on Parallel and Distributed Systems, 1995
- Elliptic curve cryptosystemsMathematics of Computation, 1987
- Modular multiplication without trial divisionMathematics of Computation, 1985
- A method for obtaining digital signatures and public-key cryptosystemsCommunications of the ACM, 1978
- Mersenne and Fermat numbersProceedings of the American Mathematical Society, 1954