Multiplying two massive prime numbers takes a fraction of a second on a computer; factoring that product back into its original primes takes millions of years. By anchoring asymmetric encryption to the asymmetry of prime numbers, Ron Rivest, Adi Shamir, and Leonard Adleman created RSA—the cryptographic algorithm that encrypts every browser connection, banking transfer, and software update on Earth.
Following Diffie and Hellman's theoretical concept of public-key cryptography, the computer science community lacked a practical mathematical function to build a working system. The world needed an elegant mathematical one-way street: an operation that is trivial to perform in one direction but impossible to reverse.
Three MIT researchers discovered the answer in ancient prime number arithmetic: the RSA algorithm. Multiplying two giant 300-digit prime numbers together takes a computer a millisecond, but taking the resulting product and figuring out which two primes created it would take all the supercomputers on Earth millions of years.
RSA became the most widely deployed security algorithm in human history. By securing the green padlock in every web browser, by preventing identity fraud through unforgeable digital signatures, and by protecting trillions of dollars in daily electronic commerce, RSA underpins the security of modern civilization.
A method for obtaining digital signatures and public-key cryptosystems
An encryption method is presented with the novel property that publicly revealing an encryption key does not thereby reveal the corresponding decryption key. This has two important consequences: (1) Couriers or other secure means are not needed to transmit keys, since a message can be enciphered using an encryption key publicly revealed by the intented recipient. Only he can decipher the message, since only he knows the corresponding decryption key. (2) A message can be “signed” using a privately held decryption key. Anyone can verify this signature using the corresponding publicly revealed encryption key. Signatures cannot be forged, and a signer cannot later deny the validity of his signature. This has obvious applications in “electronic mail” and “electronic funds transfer” systems. A message is encrypted by representing it as a number M, raising M to a publicly specified power e, and then taking the remainder when the result is divided by the publicly specified product, n, of two large secret primer numbers p and q. Decryption is similar; only a different, secret, power d is used, where e * d ≡ 1(mod (p - 1) * (q - 1)). The security of the system rests in part on the difficulty of factoring the published divisor, n.
Digital data is inherently easy to copy, clone, and counterfeit with perfect fidelity; Stephen Wiesner proved that storing information in polarized photons makes it physically impossible to counterfeit banknotes without destroying the quantum evidence. Rejected by academic journals for fifteen years, Wiesner’s 1968 paper on "Conjugate Coding" founded quantum cryptography, directly inspiring the famous BB84 quantum encryption protocol protecting modern government communications.
Generative AI chemistry models frequently generated hypothetical molecules with stellar computer-predicted binding affinities that were impossible to synthesize in wet labs; reaction-driven generative algorithms construct drug candidates exclusively from validated chemical building blocks.
Deep neural networks excel at statistical intuition while symbolic systems master formal deductive logic; formulating unified categorical semantics bridges neural vector embeddings with formal symbolic reasoning provers.
Telecommunication engineers believed that static noise permanently corrupted electrical signals; Claude Shannon proved that information can be transmitted with zero errors across noisy channels by converting meaning into binary bits. Published in 1948, Shannon’s masterwork founded information theory and created the digital language of the modern world.
Early nucleotide analysis relied on slow radioactive degradation techniques that could only decipher a dozen genetic letters per year; Fred Sanger designed chemical "terminator" nucleotides that freeze DNA replication at precise atomic coordinates. By sorting the resulting fragments by length on a gel, Sanger sequencing allowed scientists to read the exact chemical sequence of entire genomes.
Physical sensors in rockets and satellites are constantly corrupted by noise, vibration, and sensor drift; Rudolf Kalman developed an optimal mathematical filter that predicts true position by fusing imperfect sensor readings with equations of motion in real time. Published in 1960, the Kalman Filter guided the Apollo spacecraft to the Moon and is the mathematical brain powering every GPS receiver, autonomous drone, and commercial jetliner on Earth.
Obtaining versatile human stem cells once required the destruction of human embryos and was locked in fierce ethical battles; Shinya Yamanaka discovered that injecting just four genetic factors can turn ordinary adult skin cells into embryonic-like stem cells. Awarded the 2012 Nobel Prize in Medicine just six years after publication, Yamanaka’s discovery of "induced pluripotent stem cells" created a cellular time machine, revolutionizing regenerative medicine, drug testing, and personalized organ generation.
Computer scientists believed that mastering the ancient game of Go required human intuition that machines would not achieve for decades; DeepMind’s AlphaGo paired deep neural networks with Monte Carlo tree search to defeat the world champion. Published in 2016, AlphaGo proved that deep reinforcement learning could exhibit genuine creative intuition, sparking the modern Artificial General Intelligence revolution.
Ask this paper your own questions, or keep browsing the verified research catalogue.
