Sciweavers

517 search results - page 19 / 104
» Bit Encryption Is Complete
Sort
View
STOC
2005
ACM
110views Algorithms» more  STOC 2005»
14 years 8 months ago
Key agreement from weak bit agreement
Assume that Alice and Bob, given an authentic channel, have a protocol where they end up with a bit SA and SB, respectively, such that with probability 1+ 2 these bits are equal. ...
Thomas Holenstein
CEE
2004
205views more  CEE 2004»
13 years 8 months ago
64-bit Block ciphers: hardware implementations and comparison analysis
A performance comparison for the 64-bit block cipher (Triple-DES, IDEA, CAST-128, MISTY1, and KHAZAD) FPGA hardware implementations is given in this paper. All these ciphers are u...
Paris Kitsos, Nicolas Sklavos, Michalis D. Galanis...
STOC
2005
ACM
93views Algorithms» more  STOC 2005»
14 years 8 months ago
Representing hard lattices with O(n log n) bits
We present a variant of the Ajtai-Dwork public-key cryptosystem where the size of the public-key is only O(n log n) bits and the encrypted text/clear text ratio is also O(n log n)...
Miklós Ajtai
SACRYPT
1999
Springer
14 years 10 days ago
Key-Schedule Cryptanalysis of DEAL
DEAL is a six- or eight-round Luby-Rackoff cipher that uses DES as its round function, with allowed key lengths of 128, 192, and 256 bits. In this paper, we discuss two new result...
John Kelsey, Bruce Schneier
EUROCRYPT
2004
Springer
14 years 1 months ago
On Generating the Initial Key in the Bounded-Storage Model
Abstract. In the bounded-storage model (BSM) for information-theoretically secure encryption and key-agreement one uses a random string R whose length t is greater than the assumed...
Stefan Dziembowski, Ueli M. Maurer