Sciweavers

SACRYPT
2001
Springer
106views Cryptology» more  SACRYPT 2001»
13 years 9 months ago
Fast Normal Basis Multiplication Using General Purpose Processors
—For cryptographic applications, normal bases have received considerable attention, especially for hardware implementation. In this article, we consider fast software algorithms ...
Arash Reyhani-Masoleh, M. Anwarul Hasan
SACRYPT
2001
Springer
13 years 9 months ago
Timed-Release Cryptography
Wenbo Mao
SACRYPT
2001
Springer
123views Cryptology» more  SACRYPT 2001»
13 years 9 months ago
Weaknesses in the Key Scheduling Algorithm of RC4
Abstract. Inthis paper we present several weaknesses in the keyscheduling algorithm of RC4, and describe their cryptanalytic signi cance. We identify a large number of weak keys, i...
Scott R. Fluhrer, Itsik Mantin, Adi Shamir
SACRYPT
2001
Springer
126views Cryptology» more  SACRYPT 2001»
13 years 9 months ago
Analysis of the E0 Encryption System
The encryption system E0, which is the encryption system used in the Bluetooth specification, is examined. In the current paper, a method of deriving the cipher key from a set of ...
Scott R. Fluhrer, Stefan Lucks
SACRYPT
2001
Springer
13 years 9 months ago
A Simple Algebraic Representation of Rijndael
We show that there is a very straightforward closed algebraic formula for the Rijndael block cipher. This formula is highly structured and far simpler then algebraic formulations o...
Niels Ferguson, Richard Schroeppel, Doug Whiting
SACRYPT
2001
Springer
110views Cryptology» more  SACRYPT 2001»
13 years 9 months ago
Random Walks Revisited: Extensions of Pollard's Rho Algorithm for Computing Multiple Discrete Logarithms
This paper extends the analysis of Pollard’s rho algorithm for solving a single instance of the discrete logarithm problem in a finite cyclic group G to the case of solving more...
Fabian Kuhn, René Struik
SACRYPT
2001
Springer
13 years 9 months ago
Fast Generation of Pairs (k, [k]P) for Koblitz Elliptic Curves
Jean-Sébastien Coron, David M'Raïhi, C...
SACRYPT
2001
Springer
136views Cryptology» more  SACRYPT 2001»
13 years 9 months ago
New (Two-Track-)MAC Based on the Two Trails of RIPEMD
We present a new message authentication code. It is based on a two trail construction, which underlies the unkeyed hash function RIPEMD-160. It is in comparison with the MDx-MAC ba...
Bert den Boer, Bart Van Rompay, Bart Preneel, Joos...
SACRYPT
2001
Springer
130views Cryptology» more  SACRYPT 2001»
13 years 9 months ago
On the Complexity of Matsui's Attack
Linear cryptanalysis remains the most powerful attack against DES at this time. Given 243 known plaintext-ciphertext pairs, Matsui expected a complexity of less than 243 DES evalua...
Pascal Junod
SACRYPT
2001
Springer
13 years 9 months ago
Two Topics in Hyperelliptic Cryptography
Florian Hess, Gadiel Seroussi, Nigel P. Smart