all InfoSec news
Worst-Case Subexponential Attacks on PRGs of Constant Degree or Constant Locality
Feb. 7, 2023, 2:06 p.m. |
IACR News www.iacr.org
ePrint Report: Worst-Case Subexponential Attacks on PRGs of Constant Degree or Constant Locality
Akin Ünal
In this work, we will give new attacks on the pseudorandomness of algebraic pseudorandom number generators (PRGs) of polynomial stretch. Our algorithms apply to a broad class of PRGs and are in the case of general local PRGs faster than currently known attacks. At the same time, in contrast to most algebraic attacks, subexponential time and space bounds will be proven for our attacks without …
algorithms attacks case class eprint report general local report stretch work
More from www.iacr.org / IACR News
Updatable Policy-Compliant Signatures
1 day, 16 hours ago |
www.iacr.org
Guess and Determine Analysis Based on Set Split
1 day, 16 hours ago |
www.iacr.org
Improving Generic Attacks Using Exceptional Functions
1 day, 17 hours ago |
www.iacr.org
Real-Valued Somewhat-Pseudorandom Unitaries
2 days, 20 hours ago |
www.iacr.org
A Variation on Knellwolf and Meier's Attack on the Knapsack Generator
2 days, 20 hours ago |
www.iacr.org
Jobs in InfoSec / Cybersecurity
Information Technology Specialist II: Network Architect
@ Los Angeles County Employees Retirement Association (LACERA) | Pasadena, CA
Cybersecurity Skills Challenge -- Sponsored by DoD
@ Correlation One | United States
Security Operations Center (SOC) Analyst
@ GK Cybersecurity Group | Remote
Cyber Threat Defense - PAM Manager
@ PwC | Amsterdam - Thomas R. Malthusstraat 5
InfoSec Specialist
@ Deutsche Bank | Bucharest
DevSecOps Engineer
@ Swiss Re | Bengaluru, KA, IN