Sciweavers

SACRYPT
2005
Springer
13 years 10 months ago
SPA Resistant Left-to-Right Integer Recodings
We present two left-to-right integer recodings which can be used to perform scalar multiplication with a fixed sequence of operations. These recodings make it possible to have a s...
Nicolas Thériault
SACRYPT
2005
Springer
13 years 10 months ago
Impact of Rotations in SHA-1 and Related Hash Functions
Norbert Pramstaller, Christian Rechberger, Vincent...
SACRYPT
2005
Springer
125views Cryptology» more  SACRYPT 2005»
13 years 10 months ago
Breaking a New Hash Function Design Strategy Called SMASH
Norbert Pramstaller, Christian Rechberger, Vincent...
SACRYPT
2005
Springer
146views Cryptology» more  SACRYPT 2005»
13 years 10 months ago
An Access Control Scheme for Partially Ordered Set Hierarchy with Provable Security
In a hierarchical structure, an entity has access to another if and only if the former is a superior of the later. The access control scheme for a hierarchy represented by a partia...
Jiang Wu, Ruizhong Wei
SACRYPT
2005
Springer
138views Cryptology» more  SACRYPT 2005»
13 years 10 months ago
On the (Im)Possibility of Practical and Secure Nonlinear Filters and Combiners
A vast amount of literature on stream ciphers is directed to the cryptanalysis of LFSR-based filters and combiners, resulting in various attack models such as distinguishing attac...
An Braeken, Joseph Lano
SACRYPT
2005
Springer
112views Cryptology» more  SACRYPT 2005»
13 years 10 months ago
Pairing-Friendly Elliptic Curves of Prime Order
Previously known techniques to construct pairing-friendly curves of prime or near-prime order are restricted to embedding degree k 6. More general methods produce curves over Fp wh...
Paulo S. L. M. Barreto, Michael Naehrig
SACRYPT
2005
Springer
13 years 10 months ago
Proving the Security of AES Substitution-Permutation Network
In this paper we study the substitution-permutation network (SPN) on which AES is based. We introduce AES∗ , a SPN identical to AES except that fixed S-boxes are replaced by ran...
Thomas Baignères, Serge Vaudenay
SACRYPT
2005
Springer
109views Cryptology» more  SACRYPT 2005»
13 years 10 months ago
Reducing Time Complexity in RFID Systems
Radio frequency identification systems based on low-cost computing devices is the new plaything that every company would like to adopt. Its goal can be either to improve the produ...
Gildas Avoine, Etienne Dysli, Philippe Oechslin
SACRYPT
2005
Springer
13 years 10 months ago
Fault Attacks on Combiners with Memory
Frederik Armknecht, Willi Meier
SACRYPT
2005
Springer
189views Cryptology» more  SACRYPT 2005»
13 years 10 months ago
A Scalable, Delegatable Pseudonym Protocol Enabling Ownership Transfer of RFID Tags
The ability to link two different sightings of the same Radio Frequency Identification (RFID) tag enables invasions of privacy. The problem is aggravated when an item, and the ta...
David Molnar, Andrea Soppera, David Wagner