WARNING, pinned: toots mostly consist of non-CWed Internet memes, anime memes, personal debates, politics, sometimes discussion of controversial ideologies (but it's probably in Chinese w/ CW), even worse, mostly written in Chinese which you cannot understand. Only occasionally posting FLOSS and security-related news and opinions. Wants to follow? Proceed with care. All the views and opinions expressed here is my personal, not necessarily (and mostly, not) related to any organization I am affiliated to.
"Marisa, do you know where the self-test menu is?" https://www.pixiv.net/en/artworks/65383204 #electronics #2hu #touhou
I think I finally figured out where do the 4chan trolls come from. https://danbooru.donmai.us/posts/1378864
Verifying the complied Cryptoline assembly code from C, which itself is a model of the PDP-11 assembly code, is a futile attempt. After C optimization, logic is different and useful invariants disappear. New idea: write an assembler to convert PDP-11 assembly directly to the Cryptoline verification language - both are at the assembly level and should be easier to work with.
I got an email about a class action settlement over alleged price fixing of CD/DVD drives in the early 2000s. Went to the website for more info, and found... this. 😲
CNAME tracking's a disaster. uBlock Origin blocks it in FF. Chrome users are SOL
https://arxiv.org/abs/2102.09301
(submitted by spenvo)
@eqe I saw them too. Interestingly, Within a day, Leo Ducas ("one top expert in lattice-based cryptography") has implemented a prototype in a SageMath script. Ducas said he found "obtaining a sufficient success rate requires much larger lattice dimension than claimed in the paper". https://github.com/lducas/SchnorrGate
Schnorr converts the integer factorization problem to a lattice SVP/CVP problem, and claims he has an efficient algorithm to solve S/CVP, so he just destroyed RSA.
If his claims are really true (still to be determined by peer reviews) - I don't especially care about RSA but its replacements - how many lattice-based post-quantum algorithms can survive? The hardness assumption of SVP and CVP is very the foundation that the entire field of lattice crypto is built upon, and it's the current candidate to replace all of today's public-key cryptosystems like RSA and ECC.
Disclaimer: Of course I don't understand anything I just said.
Now it's very strange. Schnorr confirmed (!) he himself uploaded the paper, but why didn't he upload the newer one? Now it's confirmed, to hedge my bet, "having a much better security record than RSA" was the main argument for transitioning to elliptic curve crypto. Factorization always had a history of many speedups and theoretical breakthroughs. I won't be surprised if it's genuinely new progress here.
Code monkey, sysadmin of Beijing GNU/Linux User Group / No nations, no flags, no patriots. / Chaotic Neutral / Now Accelerationist / 🔐 “Onii-chan is watching you!", use OpenPGP: FAD3EB05E88E8D6D / currently NEET / biologically male, self-identified as '; DROP TABLE genders;