2,662 reputation
920
bio website
location
age
visits member for 3 years
seen yesterday

Jan
19
answered Why is this authentication procedure using Rabin crypto not useful?
Jan
15
awarded  Announcer
Jan
13
comment Is there a feasible method by which NIST ECC curves over prime fields could be intentionally rigged?
The only thing that comes close to what you are asking is Edlyn Teske's isogeny trick, mentioned in the other question. Apart from that, there is only speculation about unknown weaknesses.
Jan
13
comment Time complexity to solve Discrete log problem
You're right, of course. Given it's little-oh, that factor can actually be any function, as long as it becomes insignificant at infinity input sizes.
Jan
13
revised Time complexity to solve Discrete log problem
added 7 characters in body
Jan
13
answered Time complexity to solve Discrete log problem
Dec
27
awarded  Nice Answer
Dec
26
awarded  Custodian
Dec
26
reviewed Approve suggested edit on
Dec
26
reviewed Approve suggested edit on
Dec
26
revised Why are the lower 3 bits of curve25519/ed25519 secret keys cleared during creation?
deleted 14 characters in body
Dec
26
answered Why are the lower 3 bits of curve25519/ed25519 secret keys cleared during creation?
Dec
23
answered Why do these Python XTEA implementations require different deltas?
Dec
15
awarded  Enlightened
Dec
15
awarded  Nice Answer
Dec
6
comment Why are these techniques not feasible to crack RSA?
It seems I misunderstood what you said earlier. You're correct.
Dec
6
comment Why are these techniques not feasible to crack RSA?
It's actually equivalent to factoring: you can compute $\phi(n)$ quickly from the factors, and you can find the factors quickly from $phi(n)$. No, $d = 1/e \bmod \phi(n)$. This does not result in a fraction, because we are working in modular arithmetic. There are efficient algorithms to do this.
Dec
6
comment Why are these techniques not feasible to crack RSA?
Like factoring, it becomes much harder as $n$ grows. If you try to do it for a $2048$-bit $n$, it will not be so easy.
Dec
6
comment Why are these techniques not feasible to crack RSA?
To solve for $d$, you must find out $\phi(n)$, since $d = e^{-1} \bmod \phi(n)$. That is the hard part.
Dec
6
answered Why are these techniques not feasible to crack RSA?