Sciweavers

6 search results - page 1 / 2
» Birthday Paradox for Multi-Collisions
Sort
View
IEICET
2008
72views more  IEICET 2008»
13 years 11 months ago
Birthday Paradox for Multi-Collisions
Kazuhiro Suzuki, Dongvu Tonien, Kaoru Kurosawa, Ko...
ACNS
2008
Springer
143views Cryptology» more  ACNS 2008»
14 years 5 months ago
On the Security of the CCM Encryption Mode and of a Slight Variant
In this paper, we present an analysis of the CCM mode of operations and of a slight variant. CCM is a simple and efficient encryption scheme which combines a CBC-MAC authentication...
Pierre-Alain Fouque, Gwenaëlle Martinet, Fr&e...
JCST
2010
189views more  JCST 2010»
13 years 5 months ago
Formally Analyzing Expected Time Complexity of Algorithms Using Theorem Proving
Probabilistic techniques are widely used in the analysis of algorithms to estimate the computational complexity of algorithms or a computational problem. Traditionally, such analys...
Osman Hasan, Sofiène Tahar
PKC
2005
Springer
125views Cryptology» more  PKC 2005»
14 years 4 months ago
A Generic Scheme Based on Trapdoor One-Way Permutations with Signatures as Short as Possible
We answer the open question of the possibility of building a digital signature scheme with proven security based on the one-wayness of a trapdoor permutation and with signatures as...
Louis Granboulan
FSE
2004
Springer
130views Cryptology» more  FSE 2004»
14 years 4 months ago
Cryptanalysis of a Message Authentication Code due to Cary and Venkatesan
A cryptanalysis is given of a MAC proposal presented at CRYPTO 2003 by Cary and Venkatesan. A nice feature of the CaryVenkatesan MAC is that a lower bound on its security can be pr...
Simon R. Blackburn, Kenneth G. Paterson