Sciweavers

46 search results - page 1 / 10
» Comparing with RSA
Sort
View
DATE
2003
IEEE
87views Hardware» more  DATE 2003»
13 years 10 months ago
FPGA-Based Implementation of a Serial RSA Processor
In this paper we present an hardware implementation of the RSA algorithm for public-key cryptography. The RSA algorithm consists in the computation of modular exponentials on larg...
Antonino Mazzeo, Luigi Romano, Giacinto Paolo Sagg...
IMA
2009
Springer
124views Cryptology» more  IMA 2009»
13 years 11 months ago
Comparing with RSA
A multi-set (ms) is a set where an element can occur more than once. ms hash functions (mshfs) map mss of arbitrary cardinality to fixed-length strings. This paper introduces a ne...
Julien Cathalo, David Naccache, Jean-Jacques Quisq...
CHES
2004
Springer
167views Cryptology» more  CHES 2004»
13 years 10 months ago
Comparing Elliptic Curve Cryptography and RSA on 8-bit CPUs
Strong public-key cryptography is often considered to be too computationally expensive for small devices if not accelerated by cryptographic hardware. We revisited this statement a...
Nils Gura, Arun Patel, Arvinderpal Wander, Hans Eb...
RSA
2002
71views more  RSA 2002»
13 years 4 months ago
The infamous upper tail
Let be a finite index set and k 1 a given integer. Let further S []k be an arbitrary family of k element subsets of . Consider a (binomial) random subset p of , where p = (pi :...
Svante Janson, Andrzej Rucinski
ICISC
1998
87views Cryptology» more  ICISC 1998»
13 years 6 months ago
Rabin and RSA analogues based on non-maximal imaginary quadratic orders
Abstract. In 14] and 21] there are proposed ElGamal-type cryptosystems based on non-maximal imaginary quadratic orders with fast trapdoor decryption. The trapdoor information is th...
Detlef Hühnlein, Andreas Meyer, Tsuyoshi Taka...