Pseudo-random functions and factoring (extended abstract)

DOI10.1145/335305.335307zbMath1296.94133OpenAlexW2076630030MaRDI QIDQ3191966

Moni Naor, Omer Reingold, Alon Rosen

Publication date: 26 September 2014

Published in: Proceedings of the thirty-second annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/335305.335307

Mathematics Subject Classification ID

Cryptography (94A60) Random number generation in numerical analysis (65C10)

Related Items (8)

Adaptively secure distributed PRFs from LWE ⋮ Exploring crypto dark matter: new simple PRF candidates and their applications ⋮ Low-complexity weak pseudorandom functions in \(\mathtt{AC}0[\mathtt{MOD}2\)] ⋮ Fast Pseudorandom Functions Based on Expander Graphs ⋮ A combinatorial approach to quantum random functions ⋮ Towards tight adaptive security of non-interactive key exchange ⋮ Adaptively secure distributed PRFs from \(\mathsf{LWE}\) ⋮ Pseudorandom Functions: Three Decades Later

This page was built for publication: Pseudo-random functions and factoring (extended abstract)