Sciweavers

68 search results - page 5 / 14
» On the Security of Oscillator-Based Random Number Generators
Sort
View
PKC
1999
Springer
83views Cryptology» more  PKC 1999»
14 years 25 days ago
On the Security of Random Sources
Abstract. Many applications rely on the security of their random number generator. It is therefore essential that such devices be extensively tested for malfunction. The purpose of...
Jean-Sébastien Coron
JCS
2011
156views more  JCS 2011»
13 years 3 months ago
Securing low-cost RFID systems: An unconditionally secure approach
We explore a new direction towards solving the identity authentication problem in RFID systems. We break the RFID authentication process into two main problems: message authenticat...
Basel Alomair, Loukas Lazos, Radha Poovendran
CRYPTO
1998
Springer
105views Cryptology» more  CRYPTO 1998»
14 years 24 days ago
An Efficient Discrete Log Pseudo Random Generator
The exponentiation function in a finite field of order p (a prime number) is believed to be a one-way function. It is well known that O(log log p) bits are simultaneously hard for ...
Sarvar Patel, Ganapathy S. Sundaram
CHES
2010
Springer
172views Cryptology» more  CHES 2010»
13 years 9 months ago
Analysis and Improvement of the Random Delay Countermeasure of CHES 2009
Random delays are often inserted in embedded software to protect against side-channel and fault attacks. At CHES 2009 a new method for generation of random delays was described tha...
Jean-Sébastien Coron, Ilya Kizhvatov
CTRSA
2010
Springer
200views Cryptology» more  CTRSA 2010»
14 years 3 months ago
Resettable Public-Key Encryption: How to Encrypt on a Virtual Machine
Typical security models used for proving security of deployed cryptographic primitives do not allow adversaries to rewind or reset honest parties to an earlier state. Thus, it is c...
Scott Yilek