1 citations · 2 across the 3 of their papers we have counts for
3 papers
cs.CR2021★ 1 cited
Revisiting the Concrete Security of Goldreich's Pseudorandom Generator
Jing Yang, Qian Guo, Thomas Johansson +1
Local pseudorandom generators are a class of fundamental cryptographic primitives having very broad applications in theoretical cryptography. Following Couteau et al.'s work in ASI…
cs.CR2021★ 1 cited
On the Sample Complexity of solving LWE using BKW-Style Algorithms
Qian Guo, Erik Mårtensson, Paul Stankovski Wagner
The Learning with Errors (LWE) problem receives much attention in cryptography, mainly due to its fundamental significance in post-quantum cryptography. Among its solving algorithm…
cs.CR2014
A New Algorithm for Solving Ring-LPN with a Reducible Polynomial
Qian Guo, Thomas Johansson, Carl Löndahl
The LPN (Learning Parity with Noise) problem has recently proved to be of great importance in cryptology. A special and very useful case is the RING-LPN problem, which typically pr…