« first day (2990 days earlier)      last day (1674 days later) » 

3:29 AM
AUGHHHH we're up to >2200 unanswered questions. It was nearly below 2000 earlier this year!
 
4:06 AM
2
Q: How does IBM's 53-bit quantum computer compares to classical ones for cryptanalytic tasks?

fgrieuIBM 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.
 
 
6 hours later…
10:04 AM
@kelalaka Sigh, only in development do you get a completely different looking function when you ask sombody to copy something.
It's like asking an worker to copy a stone building and he'd drive to the woodstore to pick up some wood.
Let's randomly copy the stuff we need and then try and make it match.
 
10:34 AM
LOL, That is most common.
When I taught programming, I simply say, detecting cheating is easy, once you learn IF your programs will be almost completely different.
 
 
1 hour later…
11:41 AM
@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.
 
11:52 AM
Sometime the way @kelalaka solves these kinds of things is the best...
 
@fgrieu how? Please let me know.
 
@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.
This is something you did for much less, IIRC.
 
@fgrieu one is already marked but not enough vote (3). By the way if I've got the power I close them they way LaTex is used :)
 
 
4 hours later…
4:29 PM
How is this question about related keys, except insofar as the title happens to use the phrase?
0
Q: DIY over-encryption with a related key

user165680I 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...

 
 
1 hour later…
5:40 PM
What is the [lucas] tag supposed to mean?
 
@SqueamishOssifrage so apparently either the LUC RSA variant or the lucas primality test
(the former apparently using "lucas groups")
 
6:32 PM
"The more indistinguishable the better." That's... an interesting sentence.
 
@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.
 
7:34 PM
So, they just read "CBC" and "padding" in the title, ignored the "MAC" and the question body and launched into an answer about padding oracle attacks?
0
A: CBC-MAC Padding weaknesses

hlayhelThe 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...

 
 
1 hour later…
9:01 PM
@Maeher Seems to be a theme.
0
A: How is PBKDF2 so much better than normal Hashing or even using HMAC

hlayhelFor 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...

 
9:24 PM
Indeed.
 

« first day (2990 days earlier)      last day (1674 days later) »