Ask Lemmy
A Fediverse community for open-ended, thought provoking questions
Rules: (interactive)
1) Be nice and; have fun
Doxxing, trolling, sealioning, racism, and toxicity are not welcomed in AskLemmy. Remember what your mother said: if you can't say something nice, don't say anything at all. In addition, the site-wide Lemmy.world terms of service also apply here. Please familiarize yourself with them
2) All posts must end with a '?'
This is sort of like Jeopardy. Please phrase all post titles in the form of a proper question ending with ?
3) No spam
Please do not flood the community with nonsense. Actual suspected spammers will be banned on site. No astroturfing.
4) NSFW is okay, within reason
Just remember to tag posts with either a content warning or a [NSFW] tag. Overtly sexual posts are not allowed, please direct them to either !asklemmyafterdark@lemmy.world or !asklemmynsfw@lemmynsfw.com.
NSFW comments should be restricted to posts tagged [NSFW].
5) This is not a support community.
It is not a place for 'how do I?', type questions.
If you have any questions regarding the site itself or would like to report a community, please direct them to Lemmy.world Support or email info@lemmy.world. For other questions check our partnered communities list, or use the search function.
6) No US Politics.
Please don't post about current US Politics. If you need to do this, try !politicaldiscussion@lemmy.world or !askusa@discuss.online
Reminder: The terms of service apply here too.
Partnered Communities:
Logo design credit goes to: tubbadu
view the rest of the comments
prime number factorization is the basis of assymetric cryptography. basically, if I start with two large prime numbers (DES was 56bit prime numbers iirc), and multiply them, then the only known solution to find the original prime numbers is guess-and-check. modern keys use 4096-bit keys, and there are more prime numbers in that space than there are particles in the universe. using known computation methods, there is no way to find these keys before the heat death of the universe.
DES is symmetric key cryptography. It doesn't rely on the difficulty of factorizing large semi-primes. It did use a 56-bit key, though.
Public key cryptography (DSA, RSA, Elliptic Curve) does rely on these things and yes it's a 4096-bit key these days (up from 1024 in the older days).
thank you