Publication:4036876: Difference between revisions
From MaRDI portal
Publication:4036876
Created automatically from import240129110113 |
(No difference)
|
Latest revision as of 02:59, 6 February 2024
zbMATH Open0825.94173MaRDI QIDQ4036876FDOQ4036876
Stephen R. Dussé, Burton S. jun. Kaliski
Publication date: 18 May 1993
Title of this publication is not available (Why is that?)
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
- Communication-computation trade-off in executing ECDSA in a contactless smartcard
- DSP56000
- 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)
