I'm reading the paper by Bruce Schneier and Niels Ferguson on the Fortuna CSPRNG from 2003.
You can read it here: https://www.schneier.com/wp-content/uploads/2015/12/fortuna.pdf
Note the highlighted section. This describes precisely fast key erasure that Daniel J. Bernstein describes in his 2017 blog post: https://blog.cr.yp.to/20170723-random.html
A new proof shows quantum cryptography can be built on problems even harder than NP, offering security beyond classical encryption. Researchers introduced "one-way puzzles" to replace traditional cryptographic foundations.
https://www.quantamagazine.org/quantum-scientists-have-built-a-new-math-of-cryptography-20250725/
These are clever people: Quantum Scientists Building New Math of Cryptography
https://www.quantamagazine.org/quantum-scientists-have-built-a-new-math-of-cryptography-20250725/
One-way function
https://en.wikipedia.org/wiki/One-way_function
Quantum cryptography
https://en.wikipedia.org/wiki/Quantum_cryptography
Permanent (mathematics)
https://en.wikipedia.org/wiki/Permanent_(mathematics)
♯P-completeness of 01-permanent
https://en.wikipedia.org/wiki/%E2%99%AFP-completeness_of_01-permanent
Curious about the latest in #cryptography and #security research? The new COSIC newsletter gives you a two-month snapshot of our key achievements and updates. Read it here: https://www.esat.kuleuven.be/cosic/sites/newsletter/2025/07/24/cosic-newsletter-june-july/
I finally finished by browser-based randomness nonsense. Let me know what you think.
I think that the #openweb and #privacy are orthogonal. If #InformationWantsToBeFree then why are you using #cryptography?
They are both good things, but you can't be doing them both at the same time.
Replication of Quantum Factorisation Records with an 8-bit Home Computer, an Abacus, and a Dog: a snarky take on how unimpressive these records actually are
Factoring primes using an abacus and a dog - https://eprint.iacr.org/2025/1237.pdf #quantum #cryptography
is it weird that "I built a toy cryptography system" is treated sooo much worse compared to "I built a hobby kernel", or "I built a toy DB" or "I built an orchestrator for my home lab"? I've seen people be like "just use postgres/sqlite", sure - but that's different from "[clutches pearls], No SQL? How dare you. Perish the thought! It's not ACID! How will we ever... Never use this in production. Microkernels? They'll never be practical!"
"Selfie attack"? It really exists?
Apropos nothing, Daniel Bernstein's post from earlier in the year on the viability of quantum computing.
@rebeccawatson There actually *are* ways of performing age verification in a privacy-preserving way, thanks to zero-knowledge proof cryptography:
StRanGeLY tHoUgH, governments don't seem interested in merely knowing that a user truly is >=$some_age, and not knowing anything else about them. They really, *really* wanna know who the perverts^W adults are.
> Researchers claim to have used a #quantumComputer to factor a 2,048-bit #RSA integer.
> But the RSA number evaluated was the product of two prime factors that were too close together.
> As with a parlor magician's card deck that's been stacked for a card trick
> #Quantum #factorization is performed using sleight-of-hand numbers that have been selected to make them very easy to factorize using a #physics experiment
https://www.theregister.com/2025/07/17/quantum_cryptanalysis_criticism/
The FIPS 140-3 Go Cryptographic Module: validation of Go Cryptographic Module v1.0.0 (included in Go 1.24) to FIPS 140 standard #Cryptography #Go https://go.dev/blog/fips140
Interested in theoretical cryptography and/or formal methods? Boston University is hosting a summer school on Universally Composable Security and the EasyUC framework for formalizing UC models and proofs.
The school is from August 11 - 14, 2025. Registration is free, and we're supporting both in person and Zoom participation.
For more information and to register, visit:
@chewie "When Cunningham won at Matapan, By the grace of God and Mavis,
"Nigro simillima cygno est, praise Heaven, A very rara avis"
Garden historian. What strikes me is the seemingly ordinariness of these #CodeBreakers; The depth of UKs education in language, classics and science; The ability to also read the minds of OPPO operators.
Station X: <https://youtube.com/watch?v=Y3gRQ7NmbrU>
#MI6 / #cryptography / #rodding / #cribbing / #PERX
Oh dear.
Researchers figure out how to undermine Fiat-Shamir and the Random Oracle Model to validate untrue inputs.
This has quite serious potential implications for blockchain trust although the full extent isn’t yet known.
https://www.quantamagazine.org/computer-scientists-figure-out-how-to-prove-lies-20250709/
I remember reading a blog series claiming that popular cryptographic primitives (I think the example given was RSA?) even if they are not *mathematically* impossible to break, can nevertheless be so computationally difficult that they are *physically* impossible to break on current computers.
Does anyone know what I'm talking about?
♬ 
