Sciweavers

1562 search results - page 67 / 313
» Mathematics, Cryptology, Security
Sort
View
CRYPTO
2010
Springer
151views Cryptology» more  CRYPTO 2010»
13 years 9 months ago
Leakage-Resilient Pseudorandom Functions and Side-Channel Attacks on Feistel Networks
Abstract. A cryptographic primitive is leakage-resilient, if it remains secure even if an adversary can learn a bounded amount of arbitrary information about the computation with e...
Yevgeniy Dodis, Krzysztof Pietrzak
JOC
2007
169views more  JOC 2007»
13 years 8 months ago
Another Look at "Provable Security"
We give an informal analysis and critique of several typical “provable security” results. In some cases there are intuitive but convincing arguments for rejecting the conclusi...
Neal Koblitz, Alfred Menezes
CRYPTO
2012
Springer
254views Cryptology» more  CRYPTO 2012»
11 years 10 months ago
Breaking and Repairing GCM Security Proofs
Abstract. In this paper, we study the security proofs of GCM (Galois/Counter Mode of Operation). We first point out that a lemma, which is related to the upper bound on the probab...
Tetsu Iwata, Keisuke Ohashi, Kazuhiko Minematsu
TCC
2010
Springer
170views Cryptology» more  TCC 2010»
14 years 1 days ago
On Related-Secret Pseudorandomness
Related-key attacks are attacks against constructions which use a secret key (such as a blockcipher) in which an attacker attempts to exploit known or chosen relationships among ke...
David Goldenberg, Moses Liskov
SSC
2007
Springer
147views Cryptology» more  SSC 2007»
14 years 2 months ago
Remarks on a Sequence of Minimal Niven Numbers
In this short note we introduce two new sequences defined using the sum of digits in the representation of an integer in a certain base. A connection to Niven numbers is proposed ...
H. Fredricksen, E. J. Ionascu, Florian Luca, Pante...