scientific article; zbMATH DE number 2079918

MaRDI QIDQ4472062zbMATH OpenFDO

Authors Colin D. Walter

Publication date 3 August 2004

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

Mathematics Subject Classification ID

Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Number-theoretic algorithms; complexity (11Y16) Mathematical problems of computer architecture (68M07)

Recommendations

• Cryptography and Coding
• scientific article; zbMATH DE number 1759301
• scientific article; zbMATH DE number 1504802
• scientific article; zbMATH DE number 1617927
• Can Montgomery parasites be avoided? A design methodology based on key and cryptosystem modifications

Cited in

(7)

• Efficient 15,360-bit RSA Using Woop-Optimised Montgomery Arithmetic
• \((\mathrm{p,q})\)-analysis of Montgomery identity and estimates of \((\mathrm{p,q})\)-bounds with applications
• Reduce-by-feedback: timing resistant and DPA-aware modular multiplication plus: how to break RSA by DPA
• New frameworks for Montgomery’s modular multiplication method
• Stochastic methods defeat regular RSA exponentiation algorithms with combined blinding methods
• Cryptography and Coding
• The \(k\)-ary Montgomery modular inverse over nonbinary computers

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 Q4472062)