Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
42
click to vote
EUROCRYPT
2000
Springer
favorite
Email
discuss
report
135
views
Cryptology
»
more
EUROCRYPT 2000
»
The Sum of PRPs Is a Secure PRF
14 years 2 months ago
Download
th.informatik.uni-mannheim.de
Given d independent pseudorandom permutations (PRPs) i, . . . , d over {0, 1}n , it appears natural to define a pseudorandom function (PRF) by adding (or XORing) the permutation results: sumd (x) = 1(x)
Stefan Lucks
Real-time Traffic
Cryptology
|
EUROCRYPT 2000
|
Independent Pseudorandom Permutations
|
Pseudorandom Function
|
Single Prp
|
claim paper
Related Content
»
Concrete Security Characterizations of PRFs and PRPs Reductions and Applications
»
New Blockcipher Modes of Operation with Beyond the Birthday Bound Security
»
Pseudorandom functions and parallelizable modes of operations of a block cipher
more »
Post Info
More Details (n/a)
Added
24 Aug 2010
Updated
24 Aug 2010
Type
Conference
Year
2000
Where
EUROCRYPT
Authors
Stefan Lucks
Comments
(0)
Researcher Info
Cryptology Study Group
Computer Vision