Can Montgomery parasites be avoided? A design methodology based on key and cryptosystem modifications
DOI10.1007/BF01388505zbMATH Open0814.94016OpenAlexW2004022655MaRDI QIDQ1344528FDOQ1344528
Authors: David Naccache, David M'Raïhi, Dan Raphaeli 
Publication date: 20 June 1995
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01388505
Recommendations
Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Parallel algorithms in computer science (68W10)
Cites Work
- 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
- New directions in cryptography
- Title not available (Why is that?)
- Modular Multiplication Without Trial Division
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (9)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Faster Montgomery modular multiplication without pre-computational phase for some classes of finite fields
- Montgomery reduction with even modulus
- Progress in Cryptology - INDOCRYPT 2004
- Subtraction-free almost Montgomery inverse algorithm
- The Montgomery inverse and its applications
- Title not available (Why is that?)
Uses Software
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)
