2,612 reputation
719
bio website
location
age
visits member for 2 years, 11 months
seen yesterday

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?
Dec
5
revised counting points on elliptic curve
added 4 characters in body
Dec
5
revised counting points on elliptic curve
added 3 characters in body
Dec
5
revised counting points on elliptic curve
added 70 characters in body
Dec
5
answered counting points on elliptic curve
Dec
4
comment Keyed digest function with odds of collision below the birthday bound?
Are you aware of any attempt to invert such permutations faster than brute-force? First step would probably be to distinguish the polynomial system from random.