FPGA Implementation of Pairings Using Residue Number System and Lazy Reduction
- 1 January 2011
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
Abstract
No abstract availableKeywords
This publication has 36 references indexed in Scilit:
- A family of implementation-friendly BN elliptic curvesJournal of Systems and Software, 2011
- RNS arithmetic in 𝔽 pk and application to fast pairing computationJournal of Mathematical Cryptology, 2011
- A Taxonomy of Pairing-Friendly Elliptic CurvesJournal of Cryptology, 2009
- The Weil Pairing, and Its Efficient CalculationJournal of Cryptology, 2004
- A One Round Protocol for Tripartite Diffie–HellmanJournal of Cryptology, 2004
- An RNS Montgomery modular multiplication algorithmIEEE Transactions on Computers, 1998
- Reducing elliptic curve logarithms to logarithms in a finite fieldIEEE Transactions on Information Theory, 1993
- Base extension using a convolution sum in residue number systemsComputing, 1993
- Elliptic curve cryptosystemsMathematics of Computation, 1987
- A method for obtaining digital signatures and public-key cryptosystemsCommunications of the ACM, 1978