A Proof of Security in O(2^n) for the Xor of Two Random Permutations - researchr publication bibtex

researchr

You are not signed in
Sign in
Sign up

Jacques Patarin. A Proof of Security in O(2^n) for the Xor of Two Random Permutations. IACR Cryptology ePrint Archive, 2008:10, 2008. [doi]

@article{Patarin08a,
  title = {A Proof of Security in O(2^n) for the Xor of Two Random Permutations},
  author = {Jacques Patarin},
  year = {2008},
  url = {http://eprint.iacr.org/2008/010},
  researchr = {https://researchr.org/publication/Patarin08a},
  cites = {0},
  citedby = {0},
  journal = {IACR Cryptology ePrint Archive},
  volume = {2008},
  pages = {10},
}

runs on WebDSL