RNS in Cryptography

P. V. Ananda Mohan
Additional contact information
P. V. Ananda Mohan: CDAC, R&D

Chapter Chapter 10 in Residue Number Systems, 2016, pp 263-347 from Springer

Abstract: Abstract In cryptographic applications such as RSA encryption, Diffie-Hellman Key exchange, Elliptic curve cryptography, etc., modulo multiplication and modulo exponentiation of large numbers, of bit lengths varying between 160 bits to 2048 bits, typically will be required. Two popular techniques are based on Barrett reduction and Montgomery multiplication. However, to perform the operation (X Y ) mod N for a single modulus, RNS using several small word lengths moduli can be employed. This topic has received recently considerable attention. We deal with both RNS-based and non-RNS based (i.e. using only one modulus) implementations in the following sections. In this chapter, we also consider applications of RNS in Elliptic Curve Cryptography processors and for implementation of Pairing protocols.

Keywords: Barrett Reduction; Montgomery Multiplication (MM); final Exponentiation; Miller Loop; Lazy Reduction (search for similar items in EconPapers)
Date: 2016
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-319-41385-3_10

Ordering information: This item can be ordered from
http://www.springer.com/9783319413853

DOI: 10.1007/978-3-319-41385-3_10

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().