Montgomery-suitable cryptosystems
From MaRDI portal
(Redirected from Montgomery-suitable cryptosystems)
Recommendations
Cited in
(16)- Subtraction-free almost Montgomery inverse algorithm
- Can Montgomery parasites be avoided? A design methodology based on key and cryptosystem modifications
- Speeding up RSA and elliptic curve systems by choosing suitable moduli
- Optimal use of Montgomery multiplication on smart cards
- Montgomery reduction with even modulus
- The Montgomery inverse and its applications
- Enhanced Montgomery multiplication
- Montgomery's multiplication technique: How to make it smaller and faster
- Montgomery exponentiation with no final subtractions: Improved results
- An efficient RSA implementation without precomputation
- Faster Montgomery modular multiplication without pre-computational phase for some classes of finite fields
- Unbridle the Bit-Length of a Crypto-coprocessor with Montgomery Multiplication
- Exact analysis of Montgomery multiplication
- Introduction
- Formally verified Montgomery multiplication
- Combining Montgomery multiplication with tag tracing for the Pollard rho algorithm in prime order fields
This page was built for publication: Montgomery-suitable cryptosystems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4954413)