Sciweavers

193 search results - page 16 / 39
» Fair Public-Key Cryptosystems
Sort
View
SIAMCOMP
2008
103views more  SIAMCOMP 2008»
13 years 7 months ago
Compression in Finite Fields and Torus-Based Cryptography
Abstract. We present efficient compression algorithms for subgroups of multiplicative groups of finite fields, we use our compression algorithms to construct efficient public key c...
Karl Rubin, Alice Silverberg
DCC
2000
IEEE
13 years 7 months ago
Discrete Logarithms: The Past and the Future
The first practical public key cryptosystem to be published, the Diffie-Hellman key exchange algorithm, was based on the assumption that discrete logarithms are hard to compute. T...
Andrew M. Odlyzko
AMC
2007
184views more  AMC 2007»
13 years 7 months ago
Elliptic curve scalar multiplication algorithm using complementary recoding
Elliptic curve based cryptosystem is an efficient public key cryptosystem, which is more suitable for limited environments. The very expensive operation in elliptic curve based cr...
P. Balasubramaniam, E. Karthikeyan
AFRICACRYPT
2008
Springer
14 years 2 months ago
An Adaptation of the NICE Cryptosystem to Real Quadratic Orders
Abstract. In 2000, Paulus and Takagi introduced a public key cryptosystem called NICE that exploits the relationship between maximal and non-maximal orders in imaginary quadratic n...
Michael J. Jacobson Jr., Renate Scheidler, Daniel ...
FDTC
2006
Springer
120views Cryptology» more  FDTC 2006»
13 years 11 months ago
Blinded Fault Resistant Exponentiation
As the core operation of many public key cryptosystems, group exponentiation is central to cryptography. Attacks on its implementation in embedded device setting is hence of great ...
Guillaume Fumaroli, David Vigilant