top of page
Security.BitMint.com
Randomness is a trusted shield against smarter and better equipped adversaries
Search
"Weak Keys" The Unmentioned Risk Shared by NIST PQC Candidates
The quintic polynomial cannot be solved -- as Abel and Galois have shown. Which only means that there are instances of a five degree polynomial for which no formula offers a solution. Which in practice means that there are countless instances of the quintic, subscribing to a particular class, for which there is a solving formula. The same for NIST PQC ciphers -- even if they had (which they don't) a proof of no general solution, they are all plagued by the reality that key
Gideon Samid
2 days ago2 min read
Cover Your Cyber Nakedness with a Fig Leaf of Randomness
We live in cyberspace, and thereby expose our whims, proclivities, secret desires, ambitions, love, hatred, emotions. Modern AI sees us...
Gideon Samid
Jul 191 min read
A Ciphertext as a Deterrent
Elastic encryption ciphertexts deter cryptanalysts from cracking them. New feature in the on going cyber war. An elastic ciphertext...
Gideon Samid
Jul 71 min read
Fortifying NIST-PQC Against An Attacker Smarter Than Expected
The nightmare of every cryptograher is an attacker using. surprise mathmatical insight to crack the code. The NIST-PQC cryptographer is...
Gideon Samid
Jul 42 min read
bottom of page