Sciweavers

2967 search results - page 179 / 594
» Cryptology
Sort
View
SACRYPT
2001
Springer
130views Cryptology» more  SACRYPT 2001»
15 years 11 months ago
Algorithms for Multi-exponentiation
This paper compares different approaches for computing power products 1≤i≤k gei i in finite groups. We look at the conventional simultaneous exponentiation approach and prese...
Bodo Möller
SACRYPT
2001
Springer
110views Cryptology» more  SACRYPT 2001»
15 years 11 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
15 years 11 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
AES
2000
Springer
136views Cryptology» more  AES 2000»
15 years 11 months ago
MARS Attacks! Preliminary Cryptanalysis of Reduced-Round MARS Variants
Abstract. In this paper, we discuss ways to attack various reducedround variants of MARS. We consider cryptanalysis of two reducedround variants of MARS: MARS with the full mixing ...
John Kelsey, Bruce Schneier
AES
2000
Springer
96views Cryptology» more  AES 2000»
15 years 11 months ago
Performance of the AES Candidate Algorithms in Java
We analyze the five remaining AES candidate algorithms MARS, RC6, Rijndael, Serpent, and Twofish as well as DES, Triple DES, and IDEA by examining independently developed Java imp...
Andreas Sterbenz, Peter Lipp