Sciweavers

1898 search results - page 61 / 380
» Weak Keys for IDEA
Sort
View
CRYPTO
2007
Springer
133views Cryptology» more  CRYPTO 2007»
14 years 2 months ago
Amplifying Collision Resistance: A Complexity-Theoretic Treatment
We initiate a complexity-theoretic treatment of hardness amplification for collision-resistant hash functions, namely the transformation of weakly collision-resistant hash functio...
Ran Canetti, Ronald L. Rivest, Madhu Sudan, Luca T...
ASWEC
2006
IEEE
14 years 2 months ago
Formally Analysing a Security Protocol for Replay Attacks
The Kerberos-One-Time protocol is a key distribution protocol promoted for use with Javacards to provide secure communication over the GSM mobile phone network. From inspection we...
Benjamin W. Long, Colin J. Fidge
FC
2005
Springer
109views Cryptology» more  FC 2005»
14 years 2 months ago
Fraud Within Asymmetric Multi-hop Cellular Networks
At Financial Cryptography 2003, Jakobsson, Hubaux, and Butty´an suggested a lightweight micro-payment scheme aimed at encouraging routing collaboration in asymmetric multi-hop cel...
Gildas Avoine
IWPC
2002
IEEE
14 years 1 months ago
Theory-based Analysis of Cognitive Support in Software Comprehension Tools
Past research on software comprehension tools has produced a wealth of lessons in building good tools. However our explanations of these tools tends to be weakly grounded in exist...
Andrew Walenstein
CRYPTO
1993
Springer
131views Cryptology» more  CRYPTO 1993»
14 years 25 days ago
Hash Functions Based on Block Ciphers: A Synthetic Approach
Constructions for hash functions based on a block cipher are studied where the size of the hashcode is equal to the block length of the block cipher and where the key size is appro...
Bart Preneel, René Govaerts, Joos Vandewall...