Sciweavers

SACRYPT
1998
Springer
13 years 8 months ago
The Nonhomomorphicity of Boolean Functions
Abstract. We introduce the notion of nonhomomorphicity as an alternative criterion that forecasts nonlinear characteristics of a Boolean function. Although both nonhomomorphicity a...
Xian-Mo Zhang, Yuliang Zheng
SACRYPT
1998
Springer
112views Cryptology» more  SACRYPT 1998»
13 years 8 months ago
Cryptanalysis of ORYX
Abstract. We present an attack on the ORYX stream cipher that requires only 25
David Wagner, Leone Simpson, Ed Dawson, John Kelse...
SACRYPT
1998
Springer
101views Cryptology» more  SACRYPT 1998»
13 years 8 months ago
On the Twofish Key Schedule
Twofish is a new block cipher with a 128 bit block, and a key length of 128, 192, or 256 bits, which has been submitted as an AES candidate. In this paper, we briefly review the st...
Bruce Schneier, John Kelsey, Doug Whiting, David W...
SACRYPT
1998
Springer
13 years 8 months ago
Over the Air Service Provisioning
Sarvar Patel
SACRYPT
1998
Springer
257views Cryptology» more  SACRYPT 1998»
13 years 8 months ago
Cryptanalysis of RC4-like Ciphers
Abstract. RC4, a stream cipher designed by Rivest for RSA Data Security Inc., has found several commercial applications, but little public analysis has been done to date. In this p...
Serge Mister, Stafford E. Tavares
SACRYPT
1998
Springer
13 years 8 months ago
Computational Alternatives to Random Number Generators
In this paper, we present a simple method for generating random-based signatures when random number generators are either unavailable or of suspected quality (malicious or accident...
David M'Raïhi, David Naccache, David Pointche...
SACRYPT
1998
Springer
129views Cryptology» more  SACRYPT 1998»
13 years 8 months 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»
13 years 8 months 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»
13 years 8 months 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
13 years 8 months 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