How to construct random functions
Journal of the ACM (JACM)
One-way functions and Pseudorandom generators
Combinatorica - Theory of Computing
How to construct pseudorandom permutations from pseudorandom functions
SIAM Journal on Computing - Special issue on cryptography
The Security of Cipher Block Chaining
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
Proceedings of the Third International Workshop on Fast Software Encryption
A Concrete Security Treatment of Symmetric Encryption
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
Security under key-dependent inputs
Proceedings of the 14th ACM conference on Computer and communications security
A generic method to design modes of operation beyond the birthday bound
SAC'07 Proceedings of the 14th international conference on Selected areas in cryptography
A proof of security in O(2n) for the Benes scheme
AFRICACRYPT'08 Proceedings of the Cryptology in Africa 1st international conference on Progress in cryptology
On the security of the CCM encryption mode and of a slight variant
ACNS'08 Proceedings of the 6th international conference on Applied cryptography and network security
How to thwart birthday attacks against MACs via small randomness
FSE'10 Proceedings of the 17th international conference on Fast software encryption
A new variant of PMAC: beyond the birthday bound
CRYPTO'11 Proceedings of the 31st annual conference on Advances in cryptology
New blockcipher modes of operation with beyond the birthday bound security
FSE'06 Proceedings of the 13th international conference on Fast Software Encryption
The sum of CBC MACs is a secure PRF
CT-RSA'10 Proceedings of the 2010 international conference on Topics in Cryptology
Building blockcipher from tweakable blockcipher: extending FSE 2009 proposal
IMACC'11 Proceedings of the 13th IMA international conference on Cryptography and Coding
Secure and Fast Aggregation of Financial Data in Cloud-Based Expense Tracking Applications
Journal of Network and Systems Management
3kf9: enhancing 3GPP-MAC beyond the birthday bound
ASIACRYPT'12 Proceedings of the 18th international conference on The Theory and Application of Cryptology and Information Security
Generic attacks for the Xor of k random permutations
ACNS'13 Proceedings of the 11th international conference on Applied Cryptography and Network Security
| Hi-index | 0.00 |
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) ⊕...⊕πd(x). This paper investigates the security of sumd and also considers a variant that only uses one single PRP over {0; 1}n.