this post was submitted on 21 Nov 2026
63 points (83.9% liked)

Technology

89964 readers
3217 users here now

This is a most excellent place for technology news and articles.


Our Rules


  1. Follow the lemmy.world rules.
  2. Only tech related news or articles.
  3. Be excellent to each other!
  4. Mod approved content bots can post up to 10 articles per day.
  5. Threads asking for personal tech support may be deleted.
  6. Politics threads may be removed.
  7. No memes allowed as posts, OK to post as comments.
  8. Only approved bots from the list below, this includes using AI responses and summaries. To ask if your bot can be added please contact a mod.
  9. Check for duplicates before posting, duplicates may be removed
  10. Accounts 7 days and younger will have their posts automatically removed.

Approved Bots


founded 3 years ago
MODERATORS
you are viewing a single comment's thread
view the rest of the comments
[โ€“] PetteriPano@lemmy.world 2 points 2 hours ago* (last edited 2 hours ago) (1 children)

We love using big primes for public key cryptography.

That's some black magic math that lets you take a pair of big primes. Keep one for yourself, give the other to the world. You can then encrypt or sign things with your number, and everyone with the public prime can decrypt or verify that you signed it. And vice versa, people can encrypt things that only you can decode.

As I recall, it all relies on the fact that it's a lot of work trying to find suitable primes for this. Knowing the pattern to how often primes occur can make it easier to break. This proof only predicts how many primes we'll find, so it's the basis for it.

[โ€“] Valmond@lemmy.dbzer0.com 1 points 9 minutes ago

Big primes are made with that Fermat theorem though, it has nothing to do with their distribution.