Sciweavers

126 search results - page 20 / 26
» SMASH - A Cryptographic Hash Function
Sort
View
IACR
2011
135views more  IACR 2011»
12 years 7 months ago
Algebraic Complexity Reduction and Cryptanalysis of GOST
Abstract. GOST 28147-89 is a well-known block cipher and the official encryption standard of the Russian Federation. Its large key size of 256 bits at a particularly low implementa...
Nicolas Courtois
CRYPTO
1999
Springer
159views Cryptology» more  CRYPTO 1999»
13 years 12 months ago
UMAC: Fast and Secure Message Authentication
We describe a message authentication algorithm, UMAC, which can authenticate messages (in software, on contemporary machines) roughly an order of magnitude faster than current prac...
John Black, Shai Halevi, Hugo Krawczyk, Ted Krovet...
ICDE
2009
IEEE
177views Database» more  ICDE 2009»
14 years 9 months ago
Light-Weight, Runtime Verification of Query Sources
Modern database systems increasingly make use of networked storage. This storage can be in the form of SAN's or in the form of shared-nothing nodes in a cluster. One type of a...
Tingjian Ge, Stanley B. Zdonik
ICIAR
2004
Springer
14 years 1 months ago
A Secure and Localizing Watermarking Technique for Image Authentication
In this paper, a new block-based image-dependent watermarking technique is proposed. The proposed technique utilizes the correlation coefficient statistic to produce a short and un...
Abdelkader H. Ouda, Mahmoud R. El-Sakka
FSE
1993
Springer
89views Cryptology» more  FSE 1993»
13 years 11 months ago
Parallel FFT-Hashing
Parallel FFT-Hashing was designed by C. P. Schnorr and S. Vaudenay in 1993. The function is a simple and light weight hash algorithm with 128-bit digest. Its basic component is a m...
Claus-Peter Schnorr, Serge Vaudenay