90 search results - page 4 / 18 » Fast implementations of RSA cryptography |
INFORMATICALT
2006
13 years 7 months ago
2006
We know the necessity for information security becomes more widespread in these days, especially for hardware-based implementations such as smart cards chips for wireless applicati...
RECONFIG
2008
IEEE
14 years 1 months ago
2008
IEEE
1 We present a fast, efficient, and parameterized modular multiplier and a secure exponentiation circuit especially intended for FPGAs on the low end of the price range. The desig...
FDTC
2009
Springer
14 years 1 months ago
2009
Springer
—Fault attacks constitute a major threat toward cryptographic products supporting RSA-based technologies. Most often, the public exponent is unknown, turning resistance to fault ...
IPPS
2003
IEEE
14 years 7 days ago
2003
IEEE
This paper describes a hardware architecture for modular multiplication operation which is efficient for bit-lengths suitable for both commonly used types of Public Key Cryptogra...
EUROCRYPT
2001
Springer
13 years 11 months ago
2001
Springer
The use of elliptic curves in cryptography relies on the ability to count the number of points on a given curve. Before 1999, the SEA algorithm was the only efficient method known ...