Sciweavers

164 search results - page 18 / 33
» Implementation of the GBD Cryptosystem
Sort
View
ACNS
2010
Springer
132views Cryptology» more  ACNS 2010»
14 years 1 months ago
Efficient Implementation of the Orlandi Protocol
Abstract. We present an efficient implementation of the Orlandi protocol which is the first implementation of a protocol for multiparty computation on arithmetic circuits, which is...
Thomas P. Jakobsen, Marc X. Makkes, Janus Dam Niel...
IJNSEC
2008
166views more  IJNSEC 2008»
13 years 9 months ago
Countermeasures for Hardware Fault Attack in Multi-Prime RSA Cryptosystems
The study of countermeasures for hardware fault attack in multi-prime RSA cryptosystems is very important for applications such as computer network and smart cards. In this paper,...
Zine-Eddine Abid, Wei Wang
CCS
1993
ACM
14 years 1 months ago
Why Cryptosystems Fail
Designers of cryptographic systems are at a disadvantage to most other engineers, in that information on how their systems fail is hard to get: their major users have traditionall...
Ross J. Anderson
ENC
2004
IEEE
14 years 1 months ago
On the Hardware Design of an Elliptic Curve Cryptosystem
We present a hardware architecture for an Elliptic Curve Cryptography System performing the three basic cryptographic schemes: DH key generation, encryption and digital signature....
Miguel Morales-Sandoval, Claudia Feregrino Uribe
FIWAC
1993
139views Cryptology» more  FIWAC 1993»
14 years 1 months ago
Montgomery-Suitable Cryptosystems
Montgomery’s algorithm [8], hereafter denoted Mn(·, ·), is a process for computing Mn(A, B) = ABN mod n where N is a constant factor depending only on n. Usually, AB mod n is o...
David Naccache, David M'Raïhi