Sciweavers

1562 search results - page 100 / 313
» Mathematics, Cryptology, Security
Sort
View
EUROCRYPT
2006
Springer
13 years 12 months ago
The Cramer-Shoup Encryption Scheme Is Plaintext Aware in the Standard Model
In this paper we examine the security criteria for a KEM and a DEM that are sufficient for the overall hybrid encryption scheme to be plaintext-aware in the standard model. We appl...
Alexander W. Dent
FSE
2006
Springer
107views Cryptology» more  FSE 2006»
13 years 12 months ago
Some Plausible Constructions of Double-Block-Length Hash Functions
Abstract. In this article, it is discussed how to construct a compression function with 2n-bit output using a component function with n-bit output. The component function is either...
Shoichi Hirose
FSE
2006
Springer
101views Cryptology» more  FSE 2006»
13 years 12 months ago
Pseudorandom Permutation Families over Abelian Groups
We propose a general framework for differential and linear cryptanalysis of block ciphers when the block is not a bitstring. We prove piling-up lemmas for the generalized different...
Louis Granboulan, Éric Levieil, Gilles Pire...
FSE
1997
Springer
246views Cryptology» more  FSE 1997»
13 years 11 months ago
Fast Message Authentication Using Efficient Polynomial Evaluation
Abstract. Message authentication codes (MACs) using polynomial evaluation have the advantage of requiring a very short key even for very large messages. We describe a low complexit...
Valentine Afanassiev, Christian Gehrmann, Ben J. M...
ASIACRYPT
1991
Springer
13 years 11 months ago
Limitations of the Even-Mansour Construction
In [1] a construction of a block cipher from a single pseudorandom permutation is proposed. In a complexity theoretical setting they prove that this scheme is secure against a pol...
Joan Daemen