Efficient Quantum Pseudorandomness by Brandão, Fernando G. S. L., Horodecki, Michał, Harrow, Aram W

“…Fully random transformations require exponential time for either classical or quantum systems, but in man y cases pseudorandom operations can emulate certain properties of truly random ones. …”
Get full text
Get full text

1‐Factorizations of pseudorandom graphs by Ferber, Asaf, Jain, Vishesh

Get full text

Algebraic methods in randomness and pseudorandomness by Kopparty, Swastik

Get full text

Functional Signatures and Pseudorandom Functions by Boyle, Elette, Goldwasser, Shafi, Ivan, Ioana Elisabeta

“…As a special case, this implies pseudorandom functions with selective access, where one can delegate the ability to evaluate the pseudorandom function on inputs y for which a predicate P(y) = 1 holds. …”
Get full text
Get full text

Cryptanalysis of pseudorandom number generator by Huang, Ruimin

“…A pseudorandom number generator (PRNG) is an algorithm for generating a sequence of random-like numbers. …”
Get full text

Algebraic methods in pseudorandomness and circuit complexity by Remscrim, Zachary (Zachary N.)

Get full text

Extremal results in sparse pseudorandom graphs by Conlon, David, Fox, Jacob, Zhao, Yufei

“…The main advance of this paper lies in a new counting lemma, proved following the functional approach of Gowers, which complements the sparse regularity lemma of Kohayakawa and Rodl, allowing us to count small graphs in regular subgraphs of a sufficiently pseudorandom graph. We use this to prove sparse extensions of several well-known combinatorial theorems, including the removal lemmas for graphs and groups, the Erdos–Stone–Simonovits theorem and Ramsey's theorem. …”
Get full text

Pseudorandom functions with structure : extensions and implications by Cohen, Aloni (Aloni Jonathan)

Get full text

Chaotic pseudorandom sequences and the security of cryptosystems by Hina, Aliyu Danladi, Md Said, Mohamad Rushdan, Banerjee, Santo

“…This paper intends to review the development of chaotic pseudorandom number generators through the years and the statistical tests they are required to pass as a measure of their randomness.…”
Get full text

Low complexity pseudorandom generators and indistinguishability obfuscation by Lombardi, Alex (Alex John)

Get full text

Post-Quantum Verifiable Oblivious Pseudorandom Functions by Propson, Helen

“…This work presents the construction of a post-quantum verifiable oblivious pseudorandom function (VOPRF) with a focus on efficiency and practicality. …”
Get full text

Limits on the Locality of Pseudorandom Generators and Applications to Indistinguishability Obfuscation by Lombardi, Alex, Vaikuntanathan, Vinod

“…Lin and Tessaro (ePrint 2017) recently proposed indistinguishability obfuscation (IO) and functional encryption (FE) candidates and proved their security based on two assumptions: a standard assumption on bilinear maps and a non-standard assumption on “Goldreich-like” pseudorandom generators. In a nutshell, their second assumption requires the existence of pseudorandom generators G:[q] n → {0,1} m for some poly(n) -size alphabet q, each of whose output bits depend on at most two in put alphabet symbols, and which achieve sufficiently large stretch. …”
Get full text

Robustness of Average-Case Meta-Complexity via Pseudorandomness by Ilango, Rahul, Ren, Hanlin, Santhanam, Rahul

Get full text

Z8-Kerdock codes and pseudorandom binary sequences by Lahtonen, Jyrki, Ling, San, Sole, Patrick, Zinoviev, Dmitrii

Get full text
Get full text

Generation and statistical analysis of chaos-based pseudorandom sequences by Hina, Aliyu Danladi

“…A deterministically generated pseudorandom (appear to be random) numbers are therefore relied upon. …”
Get full text

Pseudorandom dynamics of frequency combs in free-running quantum cascade lasers by Henry, Nathan, Khurgin, Jacob B., Burghoff, David Patrick, Yang, Yang, Hu, Qing

“…With this model, we confirm that the most efficient mode of operation of a free-running quantum cascade laser is indeed a pseudorandom frequency-modulated field with nearly constant intensity. …”
Get full text
Get full text
Get full text

Elliptic curves and cryptography : a pseudorandom bit generator and other tools by Kaliski, Burton Stephen

Get full text

A New Trend of Pseudorandom Number Generator using Multiple Chaotic Systems by Saba, M. Ismail, Mohammed, Muamer N., M. A., Ameedeen, Ahmed, Hussam Alddin S.

Get full text

Limitations of the Impagliazzo–Nisan–Wigderson Pseudorandom Generator Against Permutation Branching Programs by Hoza, William M., Pyne, Edward, Vadhan, Salil

“…The classic Impagliazzo–Nisan–Wigderson (INW) pseudorandom generator (PRG) (STOC ‘94) for space-bounded computation uses a seed of length 𝑂(log𝑛⋅log(𝑛𝑤/ε)+log𝑑) to fool ordered branching programs of length n, width w, and alphabet size d to within error ε . …”
Get full text

Minimum distance of error correcting codes versus encoding complexity, symmetry, and pseudorandomness by Bazzi, Louay Mohamad Jamil, 1974-

Get full text