Sciweavers

SACRYPT
1998
Springer
129views Cryptology» more  SACRYPT 1998»
14 years 25 days ago
An Accurate Evaluation of Maurer's Universal Test
Maurer's universal test is a very common randomness test, capable of detecting a wide gamut of statistical defects. The algorithm is simple (a few Java code lines), flexible (...
Jean-Sébastien Coron, David Naccache
SACRYPT
1998
Springer
173views Cryptology» more  SACRYPT 1998»
14 years 25 days ago
A Lattice-Based Public-Key Cryptosystem
In 1998, Cai and Cusick proposed a lattice-based public-key cryptosystem based on the similar ideas of the Ajtai-Dwork cryptosystem, but with much less data expansion. However, th...
Jin-yi Cai, Thomas W. Cusick
SACRYPT
1998
Springer
111views Cryptology» more  SACRYPT 1998»
14 years 25 days ago
Storage-Efficient Finite Field Basis Conversion
Abstract. This contribution proposes text for possible inclusion in IEEE P1363a specifying storageefficient finite field basis conversion techniques. Like IEEE P1363a, it is writte...
Burton S. Kaliski Jr., Yiqun Lisa Yin
SACRYPT
1998
Springer
14 years 25 days ago
Mix-Based Electronic Payments
We introduce a new payment architecture that limits the power of an attacker while providing the honest user with privacy. Our proposed method defends against all known attacks on ...
Markus Jakobsson, David M'Raïhi
SACRYPT
1998
Springer
14 years 25 days ago
A Timing Attack on RC5
Abstract. This paper describes a timing attack on the RC5 block encryption algorithm. The analysis is motivated by the possibility that some implementations of RC5 could result in ...
Helena Handschuh, Howard M. Heys
PKC
1998
Springer
107views Cryptology» more  PKC 1998»
14 years 25 days ago
On the Security of ElGamal Based Encryption
The ElGamal encryption scheme has been proposed several years ago and is one of the few probabilistic encryption schemes. However, its security has never been concretely proven bas...
Yiannis Tsiounis, Moti Yung
PKC
1998
Springer
134views Cryptology» more  PKC 1998»
14 years 25 days ago
How (not) to Design RSA Signature Schemes
The concept of public-key cryptography was invented in 1976 by Diffie and Hellman [DH]. The following year, Rivest, Shamir and Adleman provided an implementation of this idea [RSA]...
Jean-François Misarsky
PKC
1998
Springer
158views Cryptology» more  PKC 1998»
14 years 25 days ago
A Cellular Automaton Based Fast One-Way Hash Function Suitable for Hardware Implementation
One-way hash functions are an important tool in achieving authentication and data integrity. The aim of this paper is to propose a novel one-way hash function based on cellular aut...
Miodrag J. Mihaljevic, Yuliang Zheng, Hideki Imai
PKC
1998
Springer
126views Cryptology» more  PKC 1998»
14 years 25 days ago
Certifying Trust
A basic function of all signatures, digital or not, is to express trust and authority, explicit or implied. This is especially the case with digital signatures used in certificates...
Ilari Lehti, Pekka Nikander
PKC
1998
Springer
103views Cryptology» more  PKC 1998»
14 years 25 days ago
A Scheme for Obtaining a Message from the Digital Multisignature
A new digital multisignature scheme shall be proposed in this paper to allow some members of a group signing the same document and sending it to the receiver, who in turn shall ve...
Chin-Chen Chang, Jyh-Jong Leu, Pai-Cheng Huang, We...