Suchergebnisse - "Networks and circuits as models of computation"
-
1
Expander-Based Cryptography Meets Natural Proofs
ISSN: 1016-3328, 1420-8954Veröffentlicht: Cham Springer International Publishing 01.06.2022Veröffentlicht in Computational complexity (01.06.2022)“… We introduce new forms of attack on expander-based cryptography , and in particular on Goldreich’s pseudorandom generator and one-way function. Our attacks …”
Volltext
Journal Article