Advanced Search

The Sum of PRPs is a Secure PRF


Lucks, Stefan



URL: http://dx.doi.org/10.1007/3-540-45539-6_34
Document Type: Conference or workshop publication
Year of publication: 2000
Book title: Advances in cryptology : proceedings / EUROCRYPT 2000, International Conference on the Theory and Application of Cryptographic Techniques, Bruges, Belgium, May 14 - 18, 2000
The title of a journal, publication series: Lecture Notes in Computer Science
Volume: 1807
Page range: 470-484
Publisher: Preneel, Bart
Place of publication: Berlin [u.a.]
Publishing house: Springer
ISBN: 3-540-67517-5
ISSN: 0302-9743 , 1611-3349
Publication language: English
Institution: School of Business Informatics and Mathematics > Theoretische Informatik (Krause 1996-)
Subject: 004 Computer science, internet
Abstract: Given d independent pseudorandom permutations (PRPs) p_i, ..., p_d over {0,1}^n, it appears natural to define a pseudorandom function (PRF) by adding (or XORing) the permutation results: SUM^d(x)




Dieser Eintrag ist Teil der Universitätsbibliographie.




Metadata export


Citation


+ Search Authors in

BASE: Lucks, Stefan

Google Scholar: Lucks, Stefan

+ Page Views

Hits per month over past year

Detailed information



You have found an error? Please let us know about your desired correction here: E-Mail


Actions (login required)

Show item Show item