Sciweavers

397 search results - page 50 / 80
» Pseudorandom Functions and Lattices
Sort
View
MICRO
1997
IEEE
110views Hardware» more  MICRO 1997»
15 years 5 months ago
The Design and Performance of a Conflict-Avoiding Cache
High performance architectures depend heavily on efficient multi-level memory hierarchies to minimize the cost of accessing data. This dependence will increase with the expected i...
Nigel P. Topham, Antonio González, Jos&eacu...
CARDIS
2008
Springer
146views Hardware» more  CARDIS 2008»
15 years 3 months ago
Provably Secure Grouping-Proofs for RFID Tags
We investigate an application of RFIDs referred to in the literature as group scanning, in which several tags are "simultaneously" scanned by a reader device. Our goal is...
Mike Burmester, Breno de Medeiros, Rossana Motta
INFORMATICALT
2010
126views more  INFORMATICALT 2010»
14 years 10 months ago
An Entire Chaos-Based Biometric Remote User Authentication Scheme on Tokens Without Using Password
This paper presents an entire chaos-based biometric remote user authentication scheme on tokens without using passwords. The proposed scheme is based on the chaotic hash function a...
Eun-Jun Yoon, Kee-Young Yoo
DCC
2007
IEEE
16 years 26 days ago
Multiple-Description Coding by Dithered Delta-Sigma Quantization
We address the connection between the multiple-description (MD) problem and Delta-Sigma quantization. The inherent redundancy due to oversampling in Delta-Sigma quantization, and ...
Jan Østergaard, Ram Zamir
DCC
2003
IEEE
16 years 26 days ago
The Insecurity of the Elliptic Curve Digital Signature Algorithm with Partially Known Nonces
Nguyen and Shparlinski recently presented a polynomial-time algorithm that provably recovers the signer's secret DSA key when a few bits of the random nonces k (used at each s...
Phong Q. Nguyen, Igor Shparlinski