The following pages link to DSP56000 (Q42666):
Displaying 7 items.
- Efficient software-implementation of finite fields with applications to cryptography (Q850780) (← links)
- An efficient common-multiplicand-multiplication method to the Montgomery algorithm for speeding up exponentiation (Q1007833) (← links)
- Can Montgomery parasites be avoided? A design methodology based on key and cryptosystem modifications (Q1344528) (← links)
- Fast direct computation of modular reduction (Q1570258) (← links)
- Fast batch modular exponentiation with common-multiplicand multiplication (Q2410573) (← links)
- Communication-computation trade-off in executing ECDSA in a contactless smartcard (Q2491280) (← links)
- A comment on ``An efficient common-multiplicand-multiplication method to the Montgomery algorithm for speeding up exponentiation'' (Q2510465) (← links)
