Can Grover's (or similar) algorithm be used to attack AES-128 when used in cipher modes like CTR? It seems like the answer is no... Also I have a similar question for SHA256 when used for a MAC. It looks like using quantum attacks on SHA256-MAC would only produce only a parallel key that gener...
Is SHA256 MAC (or HMAC) vulnerable to any quantum attacks? Game setup: The attacker's goal is to produce a valid MAC to be accepted by other devices in the ecosystem. The ecosystem consists of many devices with a shared secret key (named "key). The attacker can query an oracle with messages...
What is the benefits of quantum computing vs parallel processing using classical computer ? Can classical parallel processors outperform quantum computing ?
Would Zero Knowledge Proof (ZKP) remove the need for Quantum Key Distribution? (QKD) Since we no longer need keys to be passed around?
I am trying to understand the paper "Breaking Symmetric Cryptosystems using Quantum Period Finding", and I reckoned the paper is roughly implying to break secret-key cryptographic system by finding the factors of the secret key. Is that correct?
After we've concluded that 64-bit is an insecurity for classical computers, I think many would like to know, how secure in a perspective view, is 64 quantum bits security. As we know, the Grover's algorithm halves the security strength offered by symmetric key primitives - a 128-bit-key block c...
According to the web page for NewHope, an R-LWE post-quantum key encapsulation mechanism (KEM) candidate for standardization, it comes in types that are or IND-CPA or IND-CCA secure. I know what CPA and CCA security are, but I don't understand the difference between the two types of NewHope and w...
I have been reading some papers on cryptography based on multivariate systems and I have a question. How does one relate the difficulty of calculating Gröbner basis (GB) of a multivariate system with its degree of regularity? From what I understand, for a lot of cryptosystems, there are ways of ...
Popular multivariate schemes are constructed by having a several easy-to-invert functions/maps as parivate key, and their composition as the public key. When signing, the hash, or a padded form of which is converted to a series of multivariate variables, and its pre-image under the maps compute...
Hi from the Q2B conference! Every nerd has surely considered the scenario where an all-knowing genie—or an enlightened guru, or a superintelligent AI, or God—appears and offers to answer any question of your choice. (Possibly subject to restrictions on the length or complexity of the question, to prevent glomming together every imaginable question.) What do […]
[By prior agreement, this post will be cross-posted on Microsoft’s Q# blog, even though it has nothing to do with the Q# programming language. It does, however, contain many examples that might be fun to implement in Q#!] Why should Nature have been quantum-mechanical? It’s totally unclear what would count as an answer to such […]
I’m planning to be in Australia soon—in Melbourne January 4-10 for a friend’s wedding, then in Sydney January 10-11 to meet colleagues and give a talk. It will be my first trip down under for 12 years (and Dana’s first ever). If there’s interest, I might be able to do a Shtetl-Optimized meetup in Melbourne […]
I have a treat with which to impress your friends at New Year’s Eve parties tomorrow night: a rollicking essay graciously contributed by a reader named Sebastian Oberhoff, about a unified and simplified way to prove all of Gödel’s Incompleteness Theorems, as well as Rosser’s Theorem, directly in terms of computer programs. In particular, this […]
« first day (1489 days earlier) ← previous day next day → last day (1823 days later) »