1562 search results - page 100 / 313 » Mathematics, Cryptology, Security |
142
click to vote
EUROCRYPT
2006
Springer
15 years 9 months ago
2006
Springer
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...
163
click to vote
FSE
2006
Springer
15 years 9 months ago
2006
Springer
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...
150
click to vote
FSE
2006
Springer
15 years 9 months ago
2006
Springer
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...
186
click to vote
FSE
1997
Springer
15 years 9 months ago
1997
Springer
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...
151
click to vote
ASIACRYPT
1991
Springer
15 years 9 months ago
1991
Springer
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...