On the concrete security of Goldreich's pseudorandom generator
type: Item
instance of: scholarly article
title: On the concrete security of Goldreich's pseudorandom generator
zbMATH Open document ID: 1446.94120
DOI: 10.1007/978-3-030-03329-3_4
author: Geoffroy Couteau
author: Aurélien Dupin
author: Pierrick Méaux
author: Mélissa Rossi
author: Yann Rotella
publication date: 2019-01-23T00:00:00Z
full work available at URL: goldreicheprint.pdf
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 65C10
zbMATH DE Number: 7005577
zbMATH Keywords: pseudorandom generators
zbMATH Keywords: algebraic attacks
zbMATH Keywords: guess-and-determine
zbMATH Keywords: Gröbner basis
MaRDI profile type: Publication
OpenAlex ID: W2898600488
Recommended article: Revisiting the Concrete Security of Goldreich’s Pseudorandom Generator
Recommended article: On the algebraic immunity -- resiliency trade-off, implications for Goldreich's pseudorandom generator
Recommended article: Q3349846
Recommended article: Cryptography and Coding
Recommended article: On the Provable Security of an Efficient RSA-Based Pseudorandom Generator
Recommended article: On the security of golden cryptosystems
Recommended article: On the security of modular exponentiation with application to the construction of pseudorandom generators
Recommended article: On the Security of Pseudorandomized Information-Theoretically Secure Schemes
Recommended article: An Efficient Pseudo-Random Generator Provably as Secure as Syndrome Decoding
description: scientific article; zbMATH DE number 7005577