Sciweavers

2237 search results - page 31 / 448
» On the Security of Random Sources
Sort
View
83
Voted
CCS
2007
ACM
15 years 3 months ago
Security under key-dependent inputs
In this work we re-visit the question of building cryptographic primitives that remain secure even when queried on inputs that depend on the secret key. This was investigated by B...
Shai Halevi, Hugo Krawczyk
84
Voted
ISCA
2010
IEEE
284views Hardware» more  ISCA 2010»
15 years 2 months ago
Security refresh: prevent malicious wear-out and increase durability for phase-change memory with dynamically randomized address
Phase change memory (PCM) is an emerging memory technology for future computing systems. Compared to other non-volatile memory alternatives, PCM is more matured to production, and...
Nak Hee Seong, Dong Hyuk Woo, Hsien-Hsin S. Lee
CRYPTO
2004
Springer
119views Cryptology» more  CRYPTO 2004»
15 years 3 months ago
Security of Random Feistel Schemes with 5 or More Rounds
We study cryptographic attacks on random Feistel schemes. We denote by m the number of plaintext/ciphertext pairs, and by k the number of rounds. In their famous paper [3], M. Luby...
Jacques Patarin
CSREASAM
2003
14 years 11 months ago
Randomized Traitor Tracing Algorithms for Broadcast Security
We introduce and analyze a randomized traitor tracing algorithm for broadcast security. This algorithm is very efficient compared to brute force methods (the mean time it takes is...
Simon McNicol, Serdar Boztas
ACISP
2000
Springer
15 years 2 months ago
Security Weaknesses in a Randomized Stream Cipher
Abstract. TriStrata appears to have implemented a variation of Maurer’s randomised cipher. We define a variation of Maurer’s cipher that appears to be similar to the TriStrata...
Niels Ferguson, Bruce Schneier, David Wagner