Paper 2012/131
Composition Theorems for CCA Cryptographic Security
Rodolphe Lampe and Jacques Patarin
Abstract
We present two new theorems to analyze the indistinguishability of the composition of cryptographic permutations and the indistinguishability of the XOR of cryptographic functions. Using the H Coefficients technique of \cite{Patarin-2001}, for any two families of permutations
Metadata
- Available format(s)
-
PDF
- Publication info
- Published elsewhere. Unknown where it was published
- Keywords
- H coefficientsSecurity proofCompositionXOR of permutationsFeistel SchemesLuby-Rackoff construction
- Contact author(s)
- rodolphe lampe @ gmail com
- History
- 2013-06-04: last of 5 revisions
- 2012-03-21: received
- See all versions
- Short URL
- https://ia.cr/2012/131
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2012/131, author = {Rodolphe Lampe and Jacques Patarin}, title = {Composition Theorems for {CCA} Cryptographic Security}, howpublished = {Cryptology {ePrint} Archive, Paper 2012/131}, year = {2012}, url = {https://eprint.iacr.org/2012/131} }