The following pages link to (Q3660954):
Displaying 6 items.
- Efficient hardware implementation of finite fields with applications to cryptography (Q850794) (← links)
- A generalisation of Brickell's algorithm for fast modular multiplication (Q1115183) (← links)
- Encroaching lists as a measure of presortedness (Q1115201) (← links)
- A design of fast pipelined modular multiplier based on a diminished-radix algorithm (Q1312101) (← links)
- Redundant integer representations and fast exponentiation (Q1910428) (← links)
- Public-key cryptography on smart cards (Q5235428) (← links)