Can Montgomery parasites be avoided? A design methodology based on key and cryptosystem modifications
From MaRDI portal
(Redirected from Publication:1344528)
Recommendations
Cites work
- scientific article; zbMATH DE number 503280 (Why is no real title available?)
- scientific article; zbMATH DE number 910960 (Why is no real title available?)
- scientific article; zbMATH DE number 1394309 (Why is no real title available?)
- A method for obtaining digital signatures and public-key cryptosystems
- A public key cryptosystem and a signature scheme based on discrete logarithms
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Modular Multiplication Without Trial Division
- New directions in cryptography
Cited in
(10)- Subtraction-free almost Montgomery inverse algorithm
- Montgomery reduction with even modulus
- Combining Montgomery multiplication with tag tracing for the Pollard rho algorithm in prime order fields
- Faster Montgomery modular multiplication without pre-computational phase for some classes of finite fields
- scientific article; zbMATH DE number 2079918 (Why is no real title available?)
- The Montgomery inverse and its applications
- scientific article; zbMATH DE number 1979274 (Why is no real title available?)
- Progress in Cryptology - INDOCRYPT 2004
- scientific article; zbMATH DE number 1504802 (Why is no real title available?)
- scientific article; zbMATH DE number 1759301 (Why is no real title available?)
This page was built for publication: Can Montgomery parasites be avoided? A design methodology based on key and cryptosystem modifications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1344528)