Technology

59673 readers

3165 users here now

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

Our Rules

Follow the lemmy.world rules.
Only tech related content.
Be excellent to each another!
Mod approved content bots can post up to 10 articles per day.
Threads asking for personal tech support may be deleted.
Politics threads may be removed.
No memes allowed as posts, OK to post as comments.
Only approved bots from the list below, to ask if your bot can be added please contact us.
Check for duplicates before posting, duplicates may be removed

Approved Bots

founded 1 year ago

MODERATORS

427

New largest prime number discovered by former Nvidia software engineer (sherwood.news)

submitted 1 month ago by gedaliyah to c/technology

120 comments fedilink hide all child comments

According to GIMPS, this is the first time a prime number was not found by an ordinary PC, but rather a “‘cloud supercomputer’ spanning 17 countries” that utilized an Nvidia A100 GPU chip to make the initial diagnosis. The primary architect of this find is Luke Durant, who worked at Nvidia as a software engineer for 11 years

you are viewing a single comment's thread
view the rest of the comments

[–] [email protected] 3 points 1 month ago

Many encryption algorithms rely on the assumption that the factorizations of numbers in prime numbers has an exponential cost and not a polynomial cost (I.e. is a NP problem and not P, and we don't know if P != NP although many would bet on it). Whether there are infinite prime numbers or not is really irrelevant in the context you are mentioning, because encryption relies on factorizing finite numbers of relatively fixed sizes.

The problem is that for big numbers like n=p*q (where p and q are both prime) it's expensive to recover p and q given n.

Note that actually more modern ciphers don't rely on this (like elliptic curve crypto).