Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

CRYPTO
2010
Springer

favoriteEmaildiscussreport

120views Cryptology» more CRYPTO 2010»

Pseudorandom Functions and Permutations Provably Secure against Related-Key Attacks

13 years 6 months ago

Pseudorandom Functions and Permutations Provably Secure against Related-Key Attacks

Download cseweb.ucsd.edu

Mihir Bellare, David Cash

Real-time Traffic

CRYPTO 2010 | Cryptology |

claim paper

Related Content

» On CipherDependent RelatedKey Attacks in the IdealCipher Model

» LeakageResilient Pseudorandom Functions and SideChannel Attacks on Feistel Networks

» New Paradigms for Constructing Symmetric Encryption Schemes Secure against ChosenCiphertex...

» Eliminating Random Permutation Oracles in the EvenMansour Cipher

» On the Security of the CCM Encryption Mode and of a Slight Variant

» Feistel Networks Made Public and Applications

Post Info
More Details (n/a)

Added	08 Nov 2010
Updated	08 Nov 2010
Type	Conference
Year	2010
Where	CRYPTO
Authors	Mihir Bellare, David Cash

Comments (0)