bug-bounty507
xss280
rce130
bragging-post118
account-takeover106
open-source94
google90
csrf85
authentication-bypass83
exploit75
stored-xss74
facebook74
privilege-escalation70
access-control65
web-security65
microsoft63
reflected-xss63
ai-agents63
cve54
input-validation51
writeup49
sql-injection48
smart-contract48
defi48
cross-site-scripting47
ssrf47
privacy46
tool46
information-disclosure45
ethereum44
api-security41
malware39
web-application39
llm37
automation36
burp-suite36
opinion35
vulnerability-disclosure34
web334
phishing34
smart-contract-vulnerability33
html-injection33
responsible-disclosure33
machine-learning32
infrastructure31
apple31
code-generation31
waf-bypass31
idor30
oauth30
0
2/10
Scott Aaronson debunks the "JVG algorithm" which claimed massive improvements over Shor's factoring algorithm by showing its core flaw: while it trades quantum computation for classical precomputation, the precomputation step itself requires exponential time to compute and load exponentially many values, making it hopeless for large numbers despite appearing to work on tiny inputs.
quantum-computing
cryptography
shor-algorithm
rsa
algorithm-analysis
preprint-criticism
computational-complexity
peer-review
JVG algorithm
Shor's algorithm
RSA-2048
Scott Aaronson
Cleve and Watrous 2000
arXiv
Preprints.org