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

Jan
13
revised Maximal-length LFSR with $n$ bits when the factorization of $2^n-1$ is unavailable?
Add justification of the fact. Add optimization. Fix typo. Improve proof.
Jan
13
comment Maximal-length LFSR with $n$ bits when the factorization of $2^n-1$ is unavailable?
@fgrieu, OK, those are good points. I've added those to the algorithm. Setting the constant term and requiring an odd number of taps is just an optimization. (If you choose a polynomial that doesn't have the low bit set, then it'll fail the check that its period divides $2^n-1$ and will be rejected in step 3 of my algorithm.)
Jan
13
revised Maximal-length LFSR with $n$ bits when the factorization of $2^n-1$ is unavailable?
Add justification of the fact. Add optimization. Fix typo.
Jan
13
revised Maximal-length LFSR with $n$ bits when the factorization of $2^n-1$ is unavailable?
added 909 characters in body
Jan
12
revised 2PC Private Set Intersection Optimized for asymmetrically sized sets
Edit question per comment thread.
Jan
10
comment Maximal-length LFSR with $n$ bits when the factorization of $2^n-1$ is unavailable?
For instance, the Unix factor commands factors $2^{320}-1$ in 1.5 seconds, yielding the factorization $2^{320}-1 = 3 \times 5 \times 5 \times 11 \times 17 \times 31 \times 41 \times 257 \times 641 \times 61681 \times 65537 \times 414721 \times 3602561 \times 6700417 \times 4278255361 \times 44479210368001 \times 94455684953484563055991838558081$.
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
revised Maximal-length LFSR with $n$ bits when the factorization of $2^n-1$ is unavailable?
fix Latex typo.
Jan
10
answered Maximal-length LFSR with $n$ bits when the factorization of $2^n-1$ is unavailable?
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.
Jan
5
awarded  Popular Question
Jan
2
awarded  Famous Question
Dec
30
answered A timestamping authority (digital notary)
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
28
answered What is 'Carry-forward verification' defense against MITM?
Dec
28
revised What does this Authentication protocol achieve and what information is shared?
Make the question more concise (by removing parts that aren't really relevant), and link to the related question.
Dec
28
revised How to attack this authentication protocol from “Cryptography: An introduction”
Link to related protocol.