26,033 reputation
11847
bio website
location
age
visits member for 2 years, 8 months
seen 6 mins ago

Aug
21
revised How does RSA signature verification work?
Added explination
Aug
21
revised How does RSA signature verification work?
Added explination
Aug
21
answered How does RSA signature verification work?
Aug
21
comment Understanding the “cube-root math” behind an RSA signature forgery
@nightcracker: well, they wanted to place at starting at bit position 2072 of the post-RSA value. Because of the second term of $(a-b)^3$ which is $-3a^2b$, then need to place $N/3$ at bit position $p$ which satisifies $2^{2072} = (2^{1019})^2 \times 2^{p}$ or $2072 = 2 \times 1019 + p$ or $p=34$
Aug
21
answered Understanding the “cube-root math” behind an RSA signature forgery
Aug
20
comment Is there any research about cryptography on nondeterministic Turing machines?
@D.W.: I'm assuming that the NTM always returns an output, whether it is 'accept' (if there is at least one path to an 'accept' state), or 'reject' (if there is no such path). You appear to assume that if there is no such path, you don't get any usable output (not even a lack of output; that can be distinguished from an 'accept' output). If you grok polynomial hierarchies (complexity theory), I'm trying to create an encryption algorithm which is in $P^{NP}$ with the key, and $NP^{NP}$ without the key.
Aug
20
reviewed Approve suggested edit on merkle-damgard tag wiki
Aug
20
reviewed Approve suggested edit on merkle-damgard tag wiki excerpt
Aug
20
answered Brute force attack on RSA - success criteria?
Aug
20
comment Is there any research about cryptography on nondeterministic Turing machines?
@D.W.: How does Eve verify a guess that a particular bit in the un-debiased string was a '0'? That is, for a specific value of $i$, there were no non-determanistic guesses that made the relation hold?
Aug
20
comment Is there any research about cryptography on nondeterministic Turing machines?
@D.W.: actually, your proposed algorithm for Eve to find $K$ doesn't appear to work; her NTM can make a guess of $K$; however it then has to verify that guess (and verify it on a DTM; that's part of the definition of a NTM). That is, she can't use nondetermanism while doing the verification. Now, her NTM can make guesses in addition to the value of $K$; however it's not at all clear what additional guesses would help.
Aug
20
revised Is there any research about cryptography on nondeterministic Turing machines?
Made it more explicit
Aug
20
revised Is there any research about cryptography on nondeterministic Turing machines?
Expanded explanation of what Eve is up against
Aug
20
revised Is there any research about cryptography on nondeterministic Turing machines?
Added an additional line of explination
Aug
20
answered Is there any research about cryptography on nondeterministic Turing machines?
Aug
20
reviewed Approve suggested edit on hash-signature tag wiki
Aug
20
reviewed Approve suggested edit on pen-and-paper tag wiki
Aug
20
reviewed Approve suggested edit on reference-request tag wiki excerpt
Aug
20
reviewed Approve suggested edit on hash-signature tag wiki excerpt
Aug
20
reviewed Approve suggested edit on multiple keys via HKDF - whats better, one or two applications of HKDF-extract