Sciweavers

2967 search results - page 321 / 594
» Cryptology
Sort
View
FSE
2001
Springer
85views Cryptology» more  FSE 2001»
15 years 11 months ago
New Results on the Pseudorandomness of Some Blockcipher Constructions
In this paper, we describe new results on the security, in the Luby-Rackoff paradigm, of two modified Feistel constructions, namely the L-scheme, a construction used at various l...
Henri Gilbert, Marine Minier
IMA
2001
Springer
134views Cryptology» more  IMA 2001»
15 years 11 months ago
Almost-Certainly Runlength-Limiting Codes
Standard runlength-limiting codes – nonlinear codes defined by trellises – have the disadvantage that they disconnect the outer errorcorrecting code from the bit-by-bit likeli...
David J. C. MacKay
INDOCRYPT
2001
Springer
15 years 11 months ago
Analysis of the GHS Weil Descent Attack on the ECDLP over Characteristic Two Finite Fields of Composite Degree
In this paper, the authors analyze the Gaudry–Hess–Smart (GHS) Weil descent attack on the elliptic curve discrete logarithm problem (ECDLP) for elliptic curves defined over c...
Markus Maurer, Alfred Menezes, Edlyn Teske
PKC
2001
Springer
116views Cryptology» more  PKC 2001»
15 years 11 months ago
Cryptanalysis of a Digital Signature Scheme on ID-Based Key-Sharing Infrastructures
At ISW’99, Nishioka, Hanaoka and Imai proposed a digital signature scheme on ID-based key-sharing infrastructures. That signature scheme is claimed to be secure if the discrete l...
Hongjun Wu, Feng Bao, Robert H. Deng
SACRYPT
2001
Springer
123views Cryptology» more  SACRYPT 2001»
15 years 11 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