Pseudorandom permutation (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Pseudorandom permutation" in English language version.

refsWebsite

Global rank English rank

3doi.org

2^nd place

2semanticscholar.org

11^th place

8^th place

2nyu.edu

1,174^th place

773^rd place

1ucdavis.edu

1,873^rd place

1,347^th place

1iacr.org

5,032^nd place

3,357^th place

1siam.org

low place

6,473^rd place

1web.archive.org

1^st place

1harvard.edu

18^th place

17^th place

1psu.edu

207^th place

136^th place

1ams.org

451^st place

277^th place

ams.org (Global: 451^st place; English: 277^th place)

mathscinet.ams.org

Micali, Silvio; Rabin, Michael; Vadhan, Salil (1999), "Verifiable random functions", 40th Annual Symposium on Foundations of Computer Science (New York, 1999), IEEE Computer Soc., Los Alamitos, CA, pp. 120–130, CiteSeerX 10.1.1.207.6638, doi:10.1109/SFFCS.1999.814584, ISBN 978-0-7695-0409-4, MR 1917552, S2CID 221565852.

doi.org (Global: 2^nd place; English: 2^nd place)

Luby, Michael; Rackoff, Charles (1988). "How to Construct Pseudorandom Permutations from Pseudorandom Functions". SIAM J. Comput. 17 (2): 373–386. doi:10.1137/0217022.
Steinberger, John P. (2007). "The Collision Intractability of MDC-2 in the Ideal-Cipher Model" (PDF). Advances in Cryptology - EUROCRYPT 2007. Lecture Notes in Computer Science. Vol. 4515. pp. 34–51. Bibcode:2007LNCS.4515...34S. doi:10.1007/978-3-540-72540-4_3. ISBN 978-3-540-72539-8. S2CID 33464561. Archived from the original (PDF) on 25 March 2007. Retrieved 27 February 2023.
Micali, Silvio; Rabin, Michael; Vadhan, Salil (1999), "Verifiable random functions", 40th Annual Symposium on Foundations of Computer Science (New York, 1999), IEEE Computer Soc., Los Alamitos, CA, pp. 120–130, CiteSeerX 10.1.1.207.6638, doi:10.1109/SFFCS.1999.814584, ISBN 978-0-7695-0409-4, MR 1917552, S2CID 221565852.

harvard.edu (Global: 18^th place; English: 17^th place)

ui.adsabs.harvard.edu

Steinberger, John P. (2007). "The Collision Intractability of MDC-2 in the Ideal-Cipher Model" (PDF). Advances in Cryptology - EUROCRYPT 2007. Lecture Notes in Computer Science. Vol. 4515. pp. 34–51. Bibcode:2007LNCS.4515...34S. doi:10.1007/978-3-540-72540-4_3. ISBN 978-3-540-72539-8. S2CID 33464561. Archived from the original (PDF) on 25 March 2007. Retrieved 27 February 2023.

iacr.org (Global: 5,032^nd place; English: 3,357^th place)

Craig Gentry and Zulfikar Ramzan. "Eliminating Random Permutation Oracles in the Even-Mansour Cipher".

nyu.edu (Global: 1,174^th place; English: 773^rd place)

ftp.cs.nyu.edu

Puniya, Prashant (2007), New Design Criteria for Hash Functions and Block Ciphers (PDF), Ph.D. thesis, Department of Computer Science, New York University.

cs.nyu.edu

Steinberger, John P. (2007). "The Collision Intractability of MDC-2 in the Ideal-Cipher Model" (PDF). Advances in Cryptology - EUROCRYPT 2007. Lecture Notes in Computer Science. Vol. 4515. pp. 34–51. Bibcode:2007LNCS.4515...34S. doi:10.1007/978-3-540-72540-4_3. ISBN 978-3-540-72539-8. S2CID 33464561. Archived from the original (PDF) on 25 March 2007. Retrieved 27 February 2023.

psu.edu (Global: 207^th place; English: 136^th place)

citeseerx.ist.psu.edu

Micali, Silvio; Rabin, Michael; Vadhan, Salil (1999), "Verifiable random functions", 40th Annual Symposium on Foundations of Computer Science (New York, 1999), IEEE Computer Soc., Los Alamitos, CA, pp. 120–130, CiteSeerX 10.1.1.207.6638, doi:10.1109/SFFCS.1999.814584, ISBN 978-0-7695-0409-4, MR 1917552, S2CID 221565852.

semanticscholar.org (Global: 11^th place; English: 8^th place)

api.semanticscholar.org

Steinberger, John P. (2007). "The Collision Intractability of MDC-2 in the Ideal-Cipher Model" (PDF). Advances in Cryptology - EUROCRYPT 2007. Lecture Notes in Computer Science. Vol. 4515. pp. 34–51. Bibcode:2007LNCS.4515...34S. doi:10.1007/978-3-540-72540-4_3. ISBN 978-3-540-72539-8. S2CID 33464561. Archived from the original (PDF) on 25 March 2007. Retrieved 27 February 2023.
Micali, Silvio; Rabin, Michael; Vadhan, Salil (1999), "Verifiable random functions", 40th Annual Symposium on Foundations of Computer Science (New York, 1999), IEEE Computer Soc., Los Alamitos, CA, pp. 120–130, CiteSeerX 10.1.1.207.6638, doi:10.1109/SFFCS.1999.814584, ISBN 978-0-7695-0409-4, MR 1917552, S2CID 221565852.

siam.org (Global: low place; English: 6,473^rd place)

epubs.siam.org

Luby, Michael; Rackoff, Charles (1988). "How to Construct Pseudorandom Permutations from Pseudorandom Functions". SIAM J. Comput. 17 (2): 373–386. doi:10.1137/0217022.

ucdavis.edu (Global: 1,873^rd place; English: 1,347^th place)

web.cs.ucdavis.edu

Mihir Bellare, Phillip Rogaway (2005-05-11). "Chapter 4: Pseudorandom functions" (PDF). Introduction to Modern Cryptography. Retrieved 2020-05-18.

web.archive.org (Global: 1^st place; English: 1^st place)

Steinberger, John P. (2007). "The Collision Intractability of MDC-2 in the Ideal-Cipher Model" (PDF). Advances in Cryptology - EUROCRYPT 2007. Lecture Notes in Computer Science. Vol. 4515. pp. 34–51. Bibcode:2007LNCS.4515...34S. doi:10.1007/978-3-540-72540-4_3. ISBN 978-3-540-72539-8. S2CID 33464561. Archived from the original (PDF) on 25 March 2007. Retrieved 27 February 2023.

Pseudorandom permutation (English Wikipedia)

ams.org (Global: 451st place; English: 277th place)

mathscinet.ams.org

doi.org (Global: 2nd place; English: 2nd place)

harvard.edu (Global: 18th place; English: 17th place)