Talk:Pseudorandom permutation

This article is rated Start-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects:

Cryptography: Computer science Low‑importance This article is within the scope of WikiProject Cryptography, a collaborative effort to improve the coverage of Cryptography on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks. Low This article has been rated as Low-importance on the importance scale. This article is supported by WikiProject Computer science (assessed as Low-importance).

The contents of the Unpredictable permutation page were merged into Pseudorandom permutation on 20 December 2016. For the contribution history and old versions of the redirected page, please see its history; for the discussion at that location, see its talk page.

merge

I suggest merging unpredictable permutation into pseudorandom permutation. The current description in these articles sounds very similar, so I suspect a single article covering both would need only a short paragraph describing the differences (if any) between them. --DavidCary (talk) 12:29, 23 November 2013 (UTC)  Done[reply]

• I've never heard of "unpredictable permutation" and I'm an experienced cryptographer. As far as I can see, it appears to be a concept used in a single PhD thesis from 2007 and nowhere else; it has not been taken up by the rest of the cryptographic community. This compares to literally thousands of papers on PRPs, a fundamental concept taught in every cryptography course. Are "unpredictable permutations" sufficiently notable to mention at all, let alone with the same weight as PRPs? This is only likely to mislead newcomers looking for a description of PRPs. --Daira Hopwood ⚥ (talk) 16:23, 8 March 2021 (UTC)[reply]