IBM just announced "a new 53-qubit quantum computer".
How does it compare to classical computers, performance-wise, for cryptanalytic tasks? E.g. finding a 48 or 64-bit value which SHA-256 has a certain value.
@SqueamishOssifrage Until we find who Captain Nemo was and get a copy of his August 1996 RSA Moduli Should Have 3 Prime Factors, I doubt well get an answer to the currently second-rated unanswered question.
And the currently top rated one seems hard to satisfactorily answer, for entirely different reasons.
@Maarten Bodewes: we both were unwise to feed the (same) contributor. Now it is added 2 additional propositions, involving 1 or 3 new variables, depending on reading. All this for something that starts much like this other question of the same OP.
@kelalaka: if, like me, you think this and this questions do not make sense (or, as I put it more gently, are unclear), you have the powers to close them.
I know next to nothing about cryptography, which is bad because I'm a programmer. I was exploring some code the other day and the encryption part of it seemed a little strange to me. I'd like the name/terminology/links to this algorithm/concept so I can learn more about it, and I'd also like to k...
@SEJPM I guess they're related by the common concept of Lucas sequences, but that seems like a stretch, and I'm having a hard time seeing why it's useful to have a tag for that.
The essence of the CBC padding attack is the INVALID_PAD information that might leak out of a decryption system. Although I write INVALID_PAD in big letters, the system may not give away such information that easy. But an attacker might look for clues that indicate whether a decryption system h...
For successful KDF, you need both good extraction and good expansion. The extractor will take from an entropy source (with some acceptable minimum entropy) and use a salt to produce a secret pseudo random key. So the extractor needs to be a PRF. Likewise, the expansion (if you need more than o...