Sciweavers

62 search results - page 2 / 13
» Fast and Secure Hashing Based on Codes
Sort
View
JOC
1998
135views more  JOC 1998»
13 years 5 months ago
Attacks on Fast Double Block Length Hash Functions
The security of hash functions based on a block cipher with a block length of m bits and a key length of k bits, where k ≤ m, is considered. New attacks are presented on a large ...
Lars R. Knudsen, Xuejia Lai, Bart Preneel
INFORMATICASI
2002
128views more  INFORMATICASI 2002»
13 years 5 months ago
Cryptanalysis of Some Hash Functions Based on Block Ciphers and Codes
At PKC 2000, Inoue and Sakurai proposed some methods to design hash functions from block ciphers and codes (block codes and convolutional codes). They claimed that their hash func...
Hongjun Wu, Feng Bao, Robert H. Deng
ICIP
2003
IEEE
14 years 7 months ago
Dither-based secure image hashing using distributed coding
We propose an image hashing algorithm that is based on distributed compression principles. The algorithm assumes the availability of a robust feature vector extracted from the ima...
Mark Johnson, Kannan Ramchandran
ACSAC
1999
IEEE
13 years 10 months ago
Fast Checking of Individual Certificate Revocation on Small Systems
High security network transactions require the checking of the revocation status of public key certificates. On mobile systems this may lead to excessive delays and unacceptable p...
Selwyn Russell
ICML
2010
IEEE
13 years 6 months ago
Sequential Projection Learning for Hashing with Compact Codes
Hashing based Approximate Nearest Neighbor (ANN) search has attracted much attention due to its fast query time and drastically reduced storage. However, most of the hashing metho...
Jun Wang, Sanjiv Kumar, Shih-Fu Chang