Sciweavers

2967 search results - page 188 / 594
» Cryptology
Sort
View
CRYPTO
1993
Springer
118views Cryptology» more  CRYPTO 1993»
15 years 11 months ago
A Subexponential Algorithm for Discrete Logarithms over All Finite Fields
Abstract. There are numerous subexponential algorithms for computing discrete logarithms over certain classes of finite fields. However, there appears to be no published subexponen...
Leonard M. Adleman, Jonathan DeMarrais
CRYPTO
1993
Springer
159views Cryptology» more  CRYPTO 1993»
15 years 11 months ago
Comparison of Three Modular Reduction Functions
Three modular reduction algorithms for large integers are compared with respect to their performance in portable software: the classical algorithm, Barrett’s algorithm and Montgo...
Antoon Bosselaers, René Govaerts, Joos Vand...
CRYPTO
1993
Springer
130views Cryptology» more  CRYPTO 1993»
15 years 11 months ago
Discreet Solitary Games
Cryptographic techniques have been used intensively in the past to show how to play multiparty games in an adversarial scenario. We now investigate the cryptographic power of a dec...
Claude Crépeau, Joe Kilian
CRYPTO
1994
Springer
128views Cryptology» more  CRYPTO 1994»
15 years 11 months ago
Linear Cryptanalysis Using Multiple Approximations
We present a technique which aids in the linear cryptanalysis of a block cipher and allows for a reduction in the amount of data required for a successful attack. We note the limit...
Burton S. Kaliski Jr., Matthew J. B. Robshaw
EUROCRYPT
1993
Springer
15 years 11 months ago
Differentially Uniform Mappings for Cryptography
This work is motivated by the observation that in DES-like ciphexs it is possible to choose the round functions in such a way that every non-trivial one-round characteristic has sm...
Kaisa Nyberg