19,607 reputation
32171
bio website
location
age
visits member for 2 years, 11 months
seen 14 hours ago

Jan
10
comment Maximal-length LFSR with $n$ bits when the factorization of $2^n-1$ is unavailable?
Well, that's a different problem statement. You might do better by asking about the actual problem you want to solve. I think the simplest solution to that problem will involve factoring $2^n-1$. I think you are over-estimating the complexity of that approach. You should be able to factor $2^{320}-1$ using standard tools, without breaking a sweat. (cont.)
Jan
10
comment Maximal-length LFSR with $n$ bits when the factorization of $2^n-1$ is unavailable?
Why would you need a LFSR of length $n=2991$? (1) Why would you need such a long LFSR? (2) Even if you needed a LFSR that has at least 2991 bits of state for some reason I haven't anticipated, why can't you just use a slightly larger LFSR, say $n=2992$?
Jan
10
comment How to prove that a ciphertext is encrypting multiplication of two values?
@curious, about your question on generic proof argument: see the sentence in my answer "It is known that every statement in NP..." Generic proof argument refers to a ZK proof that uses that general result.
Jan
10
comment How to judge if my work is meaningful in cryptography?
@Alex, I don't know! I can't answer that, without knowing what you mean by meaningful. I don't understand why you refuse to clarify. How are we supposed to help you if you won't tell us what you mean by "meaningful"? Is your definition of meaningful "approved by most of people in the field"? Is your question about how to get your work accepted in a conference? Is it about how to tell whether most people in the field agree with your results?
Jan
9
comment How to judge if my work is meaningful in cryptography?
I still don't understand what the author means by "meaningful". Do you mean "correct"? "important"? "novel"? "useful"? "valuable"? "worth money"? something else? The question needs a lot more clarification. P.S. I'm not sure what is meant by "Can I say...?" You can say anything you want; it doesn't mean you'll be right, but you can say it.
Dec
29
comment Diffie-Hellman Secret Exponent Size and Shared Secret Usage
What's the question? The entire body of the question seems to be a bunch of sentences about what you are planning to do, but I can't see any specific question. We expect questions on this site to ask a specific, objectively answerable question.
Dec
26
comment Zero knowledge proof protocol example?
Paul Wagland is 100% correct. If Bob is teasing (he is lying, and Alice is actually wearing two same-color gloves), then there's no way Bob will be able to fool Alice into thinking her gloves are mismatched. But, if Bob claims that Alice is wearing matched gloves, Alice has no way to tell whether Bob is telling the truth or not (Bob might have noticed that Alice is wearing mismatched gloves and decided to lie about it; then when they conduct the ZKP, he answers randomly). In other words: there's a proof that Alice's gloves are mismatched, but there's no proof that Alice's gloves are matched.
Dec
26
comment Does the key schedule function need to be a one-way function?
This question is not clear about what function is/isn't one-way. And, I can't make any sense of the very first sentence of the post. (Are you perhaps making some assumptions about what a key schedule must look like? If so, those assumptions are not valid. Many key schedules don't look anything like that.) Anyway, I think the question is poorly framed; it is too hard to tell what you're asking.
Dec
26
comment Security Level Estimate when Cascading/Compositing Ciphers?
You've loaded too many questions together into one. Please pick one question per question. Your first question is too broad; the answer will depend upon whether you're talking about a block cipher or something else. I suggest you just tell us about the real problem you have; or else ask multiple separate questions.
Dec
23
comment Now that quantum computers have been out for a while, has RSA been cracked?
This answer does not seem to add any added value over the existing answers.
Dec
20
comment Is this algorithm demonstrating “proof of work”
In the future, we generally ask that questions on Crypto.SE should use pseudocode to describe the algorithm concisely -- rather than giving a full implementation. Here the code makes it harder to understand what is going on, whereas you could describe the basic algorithm in one or two lines of simple mathematics. Just letting you know for the future....
Dec
20
comment Is this algorithm demonstrating “proof of work”
@kylek, I think you've misunderstood rolfl's answer. Rolfl is 100% correct on both of his criticisms, and I think you misunderstood his points and haven't fully grokked his critique yet. Maybe read it a second time? (Rolfl clearly does understand that this is for proof-of-work, not for authentication.)
Dec
19
comment Are those two distributions indistinguishable?
Thanks, @curious, that was a typo on my part. I certainly intended it to be mod $N^2$, but that did not make it from my brain to my fingers -- oops. Fixed. Thank you again.
Dec
19
comment Are those two distributions indistinguishable?
Are you sure you've got the definition of the decisional quadratic residuosity problem right? Do you have a reference? I'm not familiar with this specific hardness assumption, but based on the name, I would have expected something called the "decisional quadratic residuosity problem" to be about $x^2 \bmod N^2$ vs $r \bmod N^2$.
Dec
19
comment Is a Mersenne-twister cryptographically secure if I truncate the output?
Greg, the first step is to start by asking questions rather than drawing conclusions (such as the conclusion that Mersenne Twister is fine). You should be especially careful when your conclusions seem to run counter to what others have told you. Asking questions shows that you want to learn. Here's a starting tip: Mersenne Twister is insecure from a cryptographic perspective, and the fact that you only output partial output does not change that. You need cryptographic-level security, and the best way to get that is a CSPRNG -- which Mersenne Twister is not.
Dec
19
comment Is a Mersenne-twister cryptographically secure if I truncate the output?
Wow. There's a pretty impressive amount of misconception shown here. All I can say is: You are not qualified to write a casino game. Don't do it. There is specific technical knowledge required to do this right, and you do not have it. Try to find someone more qualified to do this aspect of design, because your instincts are leading you astray, your reasoning is wrong, your conclusion is wrong (and worse, you seem convinced that you are right).
Dec
17
comment Help with linear cryptanalysis
@Antimony - yup, that's certainly possible! The only thing I couldn't tell was: what is the best characteristic you've gotten? How many rounds, and with what bias (or what probability)? It's possible that if you asked a new question giving that specific characteristic and asking if anyone can do better, maybe someone would be inspired to try to find a better one and see if they can beat what you got. Anyway, great question -- sorry I wasn't able to give a more specific answer focused on this particular cipher.
Dec
16
comment Combining two hashing functions
possible duplicate of Guarding against cryptanalytic breakthroughs: combining multiple hash functions
Dec
16
comment Combining two hashing functions
Are you using cryptographic hash functions? If not, this is off-topic for Cryptography.SE.
Dec
15
comment Randomized stream cipher using multivariant quadratic equations
@Antimony, yeah, $n^2/2$ should suffice. I wasn't trying to optimize the constant factors (just laziness). Thank you.