scientific article; zbMATH DE number 1953319

MaRDI QIDQ4414792zbMATH OpenFDO

Authors Nadia Nedjah, Luiza de Macedo Mourelle

Publication date 27 July 2003

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2565/25650451.htm

Mathematics Subject Classification ID

Numerical algorithms for specific classes of architectures (65Y10) Cryptography (94A60)

Recommendations

• scientific article; zbMATH DE number 5017575
• scientific article; zbMATH DE number 922659
• Algorithm design and theoretical analysis of a novel CMM modular exponentiation algorithm for large integers
• scientific article; zbMATH DE number 1946644

Cited in

(20)

• High-performance hardware of the sliding-window method for parallel computation of modular exponentiations
• An iterative modular multiplication algorithm
• Single base modular multiplication for efficient hardware RNS implementations of ECC
• A scalable and systolic architectures of Montgomery modular multiplication for public key cryptosystems based on DSPS
• Fast modular multiplication based on complement representation and canonical recoding
• scientific article; zbMATH DE number 5017575 (Why is no real title available?)
• Achieving NTRU with montgomery multiplication
• A new fast modular arithmetic method in public key cryptography
• Optimal use of Montgomery multiplication on smart cards
• Algorithm design and theoretical analysis of a novel CMM modular exponentiation algorithm for large integers
• scientific article; zbMATH DE number 1341879 (Why is no real title available?)
• scientific article; zbMATH DE number 1759292 (Why is no real title available?)
• scientific article; zbMATH DE number 1759294 (Why is no real title available?)
• scientific article; zbMATH DE number 1759646 (Why is no real title available?)
• scientific article; zbMATH DE number 2118995 (Why is no real title available?)
• scientific article; zbMATH DE number 922659 (Why is no real title available?)
• Energy efficient modular exponentiation for public-key cryptography based on bit forwarding techniques
• Efficient hardware implementations of brw polynomials and tweakable enciphering schemes
• A high performance ROM-based structure for modular exponentiation
• Design of a linear systolic array for computing modular multiplication and squaring in \(\text{GF}(2^m)\)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4414792)