Computation of a 30750-Bit Binary Field Discrete Logarithm
eprint.iacr.org
Computation of a 30750-Bit Binary Field Discrete Logarithm
1–10 of 23 posts
Re: Computation of a 30750-Bit Binary Field Discrete Logarithm
#2An unpopular opinion: time until the end of ECC = 20 years
Good links:
[1] https://en.wikipedia.org/wiki/Discrete_logarithm_records
[3] http://www.dtc.umn.edu/~odlyzko/doc/arch/discrete.logs.pdf
Re: Computation of a 30750-Bit Binary Field Discrete Logarithm
#3TIL: “The best theory is inspired by practice. The best practice is inspired by theory.” (by Don aka "Yoda") An unpopular opinion: time until the end of ECC = 20 years Good links: [1] https://en.wikipedia.org/wiki/Discrete_logarithm_records [2] https://dldb.loria.fr [3] http://www.dtc.umn.edu/~odlyzko/doc/arch/discrete.logs.pdf
Re: Computation of a 30750-Bit Binary Field Discrete Logarithm
#4TIL: “The best theory is inspired by practice. The best practice is inspired by theory.” (by Don aka "Yoda") An unpopular opinion: time until the end of ECC = 20 years Good links: [1] https://en.wikipedia.org/wiki/Discrete_logarithm_records [2] https://dldb.loria.fr [3] http://www.dtc.umn.edu/~odlyzko/doc/arch/discrete.logs.pdf
why unpopular? and why 20 years?
A: because this record is on binary fields.
Re: Computation of a 30750-Bit Binary Field Discrete Logarithm
#5TIL: “The best theory is inspired by practice. The best practice is inspired by theory.” (by Don aka "Yoda") An unpopular opinion: time until the end of ECC = 20 years Good links: [1] https://en.wikipedia.org/wiki/Discrete_logarithm_records [2] https://dldb.loria.fr [3] http://www.dtc.umn.edu/~odlyzko/doc/arch/discrete.logs.pdf
Re: Computation of a 30750-Bit Binary Field Discrete Logarithm
#6TIL: “The best theory is inspired by practice. The best practice is inspired by theory.” (by Don aka "Yoda") An unpopular opinion: time until the end of ECC = 20 years Good links: [1] https://en.wikipedia.org/wiki/Discrete_logarithm_records [2] https://dldb.loria.fr [3] http://www.dtc.umn.edu/~odlyzko/doc/arch/discrete.logs.pdf
I don't think that's an unpopular opinion. 20 years is a long time in cryptography, and it'll be surprising if more than a handful of current cryptoprimitives live that long.
Qs: What about AES? RSA first or ECC?
Re: Computation of a 30750-Bit Binary Field Discrete Logarithm
#7Personally, I am not aware of any alternative systems outside of the post-quantum-crypto world.
Re: Computation of a 30750-Bit Binary Field Discrete Logarithm
#8Earlier quoted context omitted.
I don't think that's an unpopular opinion. 20 years is a long time in cryptography, and it'll be surprising if more than a handful of current cryptoprimitives live that long.
EDIT: there isn't any unpopular opinion :-) Qs: What about AES? RSA first or ECC?
Re: Computation of a 30750-Bit Binary Field Discrete Logarithm
#9TIL: “The best theory is inspired by practice. The best practice is inspired by theory.” (by Don aka "Yoda") An unpopular opinion: time until the end of ECC = 20 years Good links: [1] https://en.wikipedia.org/wiki/Discrete_logarithm_records [2] https://dldb.loria.fr [3] http://www.dtc.umn.edu/~odlyzko/doc/arch/discrete.logs.pdf
I don't think that's an unpopular opinion. 20 years is a long time in cryptography, and it'll be surprising if more than a handful of current cryptoprimitives live that long.
Re: Computation of a 30750-Bit Binary Field Discrete Logarithm
#10Earlier quoted context omitted.
I don't think that's an unpopular opinion. 20 years is a long time in cryptography, and it'll be surprising if more than a handful of current cryptoprimitives live that long.
I would be shocked if SHA-256 is fundamentally broken in the next 20 years. I also think AES will remain substantially as strong as it currently is in that timeframe, with cryptanalytic weaknesses dominated by particular block cipher modes rather than the substitution-permutation network itself.
ECB is insecure regardless of which cipher you use. There's no excuse for using it in production applications.