Sciweavers

1898 search results - page 78 / 380
» Weak Keys for IDEA
Sort
View
EUROCRYPT
2001
Springer
14 years 1 months ago
Structural Cryptanalysis of SASAS
In this paper we consider the security of block ciphers which contain alternate layers of invertible S-boxes and affine mappings (there are many popular cryptosystems which use thi...
Alex Biryukov, Adi Shamir
STOC
1999
ACM
122views Algorithms» more  STOC 1999»
14 years 1 months ago
Oblivious Transfer and Polynomial Evaluation
Oblivious polynomial evaluation is a protocol involving two parties, a sender whose input is a polynomial P, and a receiver whose input is a value α. At the end of the protocol t...
Moni Naor, Benny Pinkas
KBSE
1999
IEEE
14 years 1 months ago
Automatically Structuring Textual Requirement Scenarios
Scenarios are valuable for supporting communication among system developers in the initial phases of requirements engineering. But the problem of how to fruitfully deal with large...
Andreas Becks, Jörg Köller
PKC
1999
Springer
83views Cryptology» more  PKC 1999»
14 years 1 months ago
On the Security of Random Sources
Abstract. Many applications rely on the security of their random number generator. It is therefore essential that such devices be extensively tested for malfunction. The purpose of...
Jean-Sébastien Coron
FSE
1997
Springer
210views Cryptology» more  FSE 1997»
14 years 28 days ago
Partitioning Cryptanalysis
Matsui's linear cryptanalysis for iterated block ciphers is generalized to an attack called. This attack exploits a weakness that can be described by an e ective partition-pa...
Carlo Harpes, James L. Massey