High-speed RSA hardware based on Barret's modular reduction method
From MaRDI portal
Recommendations
- Design of RSA crypto-coprocessor based on the Barrett's modular multiplication algorithm
- High-Speed RSA Crypto-processor with Radix-4 Modular Multiplication and Chinese Remainder Theorem
- Efficient hardware implementation of modular multiplication and exponentiation for public-key cryptography
- A systolic, high speed architecture for an RSA cryptosystem
- scientific article; zbMATH DE number 2118995
Cited in
(6)- A systolic, high speed architecture for an RSA cryptosystem
- Design of RSA crypto-coprocessor based on the Barrett's modular multiplication algorithm
- Efficient modular reduction algorithm without correction phase
- scientific article; zbMATH DE number 503341 (Why is no real title available?)
- scientific article; zbMATH DE number 1542854 (Why is no real title available?)
- High-Speed RSA Crypto-processor with Radix-4 Modular Multiplication and Chinese Remainder Theorem
This page was built for publication: High-speed RSA hardware based on Barret's modular reduction method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4536222)