Montgomery reduction within the context of residue number system arithmetic
| Autor: | Julien Eynard, Nabil Merkiche, Jean-Claude Bajard |
|---|---|
| Přispěvatelé: | ALgorithms for coMmunicAtion SecuriTY (ALMASTY), Laboratoire d'Informatique de Paris 6 (LIP6), Université Pierre et Marie Curie - Paris 6 (UPMC)-Centre National de la Recherche Scientifique (CNRS)-Université Pierre et Marie Curie - Paris 6 (UPMC)-Centre National de la Recherche Scientifique (CNRS), Department of Electrical and Computer Engineering [Waterloo] (ECE), University of Waterloo [Waterloo], DGA/Ingénierie des Projets (DGA_IP), Direction générale de l'Armement (DGA), ANR-15-CE39-0002,ARRAND,Arithmétiques Randomisées(2015) |
| Jazyk: | angličtina |
| Rok vydání: | 2018 |
| Předmět: |
Hardware architecture
Computer Networks and Communications business.industry Context (language use) Cryptography 0102 computer and information sciences 02 engineering and technology Residue number system 01 natural sciences Public-key cryptography 010201 computation theory & mathematics Pairing 0202 electrical engineering electronic engineering information engineering 020201 artificial intelligence & image processing [INFO]Computer Science [cs] Lattice-based cryptography Arithmetic Hardware_ARITHMETICANDLOGICSTRUCTURES business Chinese remainder theorem Software Mathematics |
| Zdroj: | Journal of Cryptographic Engineering Journal of Cryptographic Engineering, Springer, 2018, 8 (3), pp.189-200. ⟨10.1007/s13389-017-0154-9⟩ |
| ISSN: | 2190-8508 2190-8516 |
| Popis: | International audience; This paper is a survey of Montgomery reduction in the context of residue number system arithmetic. We present the main variants of RNS Montgomery reduction, some efficient embedded hardware implementations, applications in asymmetric cryptography (RSA, ECC, pairing, lattices), to end with the use of RNS against side-channel analysis and fault attacks. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full text from SpringerLink