Revisiting the Concrete Security of Goldreich's Pseudorandom Generator

03/03/2021
by   Jing Yang, et al.
0

Local pseudorandom generators are a class of fundamental cryptographic primitives having very broad applications in theoretical cryptography. Following Couteau et al.'s work in ASIACRYPT 2018, this paper further studies the concrete security of one important class of local pseudorandom generators, i.e., Goldreich's pseudorandom generators. Our first attack is of the guess-and-determine type. Our result significantly improves the state-of-the-art algorithm proposed by Couteau et al., in terms of both asymptotic and concrete complexity, and breaks all the challenge parameters they proposed. For instance, for a parameter set suggested for 128 bits of security, we could solve the instance faster by a factor of about 2^61, thereby destroying the claimed security completely. Our second attack further exploits the extremely sparse structure of the predicate P_5 and combines ideas from iterative decoding. This novel attack, named guess-and-decode, substantially improves the guess-and-determine approaches for cryptographic-relevant parameters. All the challenge parameter sets proposed in Couteau et al.'s work in ASIACRYPT 2018 aiming for 80-bit (128-bit) security levels can be solved in about 2^58 (2^78) operations. We suggest new parameters for achieving 80-bit (128-bit) security with respect to our attacks. We also extend the attack to other promising predicates and investigate their resistance.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/14/2020

Algebraic attacks for solving the Rank Decoding and MinRank problems without Gröbner basis

Rank Decoding (RD) is the main underlying problem in rank-based cryptogr...
research
03/28/2019

Bit-Flip Attack: Crushing Neural Network withProgressive Bit Search

Several important security issues of Deep Neural Network (DNN) have been...
research
03/28/2019

Bit-Flip Attack: Crushing Neural Network with Progressive Bit Search

Several important security issues of Deep Neural Network (DNN) have been...
research
10/02/2019

An Algebraic Attack on Rank Metric Code-Based Cryptosystems

The Rank metric decoding problem is the main problem considered in crypt...
research
07/12/2021

Weakened Random Oracle Models with Target Prefix

Weakened random oracle models (WROMs) are variants of the random oracle ...
research
10/10/2020

Combining the Mersenne Twister and the Xorgens Designs

We combine the design of two random number generators, Mersenne Twister ...
research
04/28/2023

Stretching Demi-Bits and Nondeterministic-Secure Pseudorandomness

We develop the theory of cryptographic nondeterministic-secure pseudoran...

Please sign up or login with your details

Forgot password? Click here to reset