Sciweavers

126 search results - page 16 / 26
» SMASH - A Cryptographic Hash Function
Sort
View
ASIACRYPT
2010
Springer
13 years 5 months ago
Random Oracles with(out) Programmability
This paper investigates the Random Oracle Model (ROM) feature known as programmability, which allows security reductions in the ROM to dynamically choose the range points of an ide...
Marc Fischlin, Anja Lehmann, Thomas Ristenpart, Th...
CCS
2001
ACM
14 years 4 days ago
The faithfulness of abstract protocol analysis: message authentication
hfulness of Abstract Protocol Analysis: Message Authentication∗ Joshua D. Guttman F. Javier Thayer Lenore D. Zuck December 18, 2002 Dolev and Yao initiated an approach to studyi...
Joshua D. Guttman, F. Javier Thayer, Lenore D. Zuc...
CCS
2009
ACM
14 years 8 months ago
A new hash family obtained by modifying the SHA-2 family
In this work, we study several properties of the SHA-2 design which have been utilized in recent collision attacks against reduced round SHA-2. Small modifications to the SHA-2 des...
Somitra Kumar Sanadhya, Palash Sarkar
FPGA
2004
ACM
121views FPGA» more  FPGA 2004»
14 years 1 months ago
Divide and concatenate: a scalable hardware architecture for universal MAC
We present a cryptographic architecture optimization technique called divide-and-concatenate based on two observations: (i) the area of a multiplier and associated data path decre...
Bo Yang, Ramesh Karri, David A. McGrew
FSE
2005
Springer
116views Cryptology» more  FSE 2005»
14 years 1 months ago
Narrow T-Functions
T-functions were introduced by Klimov and Shamir in a series of papers during the last few years. They are of great interest for cryptography as they may provide some new building ...
Magnus Daum