scientific article; zbMATH DE number 177038

MaRDI QIDQ4036876zbMATH OpenFDO

Authors Stephen R. Dussé, Burton S. jun. Kaliski

Publication date 18 May 1993

Mathematics Subject Classification ID

Cryptography (94A60)

Cited in

(9)

• Efficient software-implementation of finite fields with applications to cryptography
• Fast direct computation of modular reduction
• An efficient Montgomery exponentiation algorithm by using signed-digit-recoding and folding techniques
• An efficient common-multiplicand-multiplication method to the Montgomery algorithm for speeding up exponentiation
• A design of fast pipelined modular multiplier based on a diminished-radix algorithm
• DSP56000
• Communication-computation trade-off in executing ECDSA in a contactless smartcard
• Fast batch modular exponentiation with common-multiplicand multiplication
• A common-multiplicand method to the Montgomery algorithm for speeding up exponentiation.

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