Modular multiplication and base extensions in residue number systems

Proceedings - Symposium on Computer Arithmetic

Volumn , Issue , 2001, Pages 59-65

  Bajard, J C ^a   Didier, L S ^a   Kornerup, P ^a  

^a LIRMM   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; MULTIPLYING CIRCUITS; NUMBER THEORY; PROGRAM PROCESSORS;

MODULAR MULTIPLICATION; RESIDUE NUMBER SYSTEMS;

DIGITAL ARITHMETIC;

EID: 0034872072     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (23)

1. An RNS montgomery modular multiplication algorithm
2. Some improvements on RNS montgomery modular multiplication
3. A survey of hardware implementations of RSA
4. Hardware implementation of Montgomery's modular multiplication algorithm
5. How to prove yourself: Practical solutions to identification and signature problems
6. k-1 - 1)
7. Cox-rower architecture for fast parallel montgomery multiplication
8. High-radix modular multiplication for cryptosystems
9. Modular multiplication without trial division
10. An improvement of the Fiat-Shamir identification and signature scheme
11. Simplifying quotient determination in high-radix modular multiplication
12. Low-cost double-size modular exponentiation or how to stretch your cryptoprocessor
13. A signed-digit architecture for residue to binary transformation
14. RNS-modulo reduction in residue number systems
15. A method for obtaining digital signatures and public-key cryptosystems
16. Fast base extension using a redundant modulus in RNS
17. Implementation issues of the two-level residue number system with pairs of conjugate moduli
18. Fast implementations of RSA cryptography
19. Modular multiplication algorithm with triangle addition
20. Residue arithmetic: A tutorial with examples
21. Systolic modular multiplication