RSA intros factoring prims and number field sieve & RSA hacks


2007: Leon Batista Alberti

2008: Alan Mathison Turing

2009: Edgar Allen Poe

2010: The Rosetta Stone

2011: The Adventures of Alice & Bob

2012: The Great Cipher Mightier Than The Sword

2013: Security in Knowledge

2014: Share. Learn. Secure.

2015: Change: Challenge today’s security thinking.

No-one dies as researchers crack 768-bit RSA encryption

1024-bit RSA encryption cracked by carefully starving CPU of electricity

RSA SecurIDs Get Cracked In 13 Minutes

Research trio crack RSA encryption keys by listening to computer noise

‘Factorisation factory’ smashes number-cracking record

Study Shows Flawed U.S. Encryption Standard Could Be Broken in Seconds

Understanding Common Factor Attacks:
An RSA-Cracking Puzzle

Pub O’clock probe finds thousands of repeated 512-bit RSA keys

Computer Scientists Crack RSA’s Ironclad Secure ID 800 Tokens (Updated)

Encryption and HUGE numbers – Numberphile

PANIC! RSA keys are compromised!

CALM DOWN: It’s only big, BAD keys, so you can relax

RSA can be broken using SHOR’S algorithm along with a quantum computer, the key lies in the theory of Euclid which says that for a number x when taken mod with n, i.e, x^y mod n (n=p*q, p and q are the primes you are looking for, and y belongs to natural number) yields a period which is divides (p-1)(q-1). The period when analysed rigorously can give all factors of (p-1)(q-1) which will give p and q values ultimately.

Quantum computation | Michelle Simmons | TEDxSydney

US government developing ultimate cyber weapon; Prime-factoring quantum computing makes encryption obsolete

Elliptic Curve Diffie Hellman

How did the NSA hack our emails?

Quantum Computation of Prime Number Functions

New largest number factored on a quantum device is 56,153

Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

Quantum Computers, Factoring, and Decoherence

Shor’s Factoring Algorithm and Modern Cryptography. An Illustration of the Capabilities Inherent in Quantum Computers

Pretending to factor large numbers on a quantum computer

The largest prime factor of X3+2

Parity problem (sieve theory)

Two Compact Incremental Prime Sieves

Cryptography, Quantum Computation and Trapped Ions

A statistical mechanics approach to the factorization problem

Eratosthenes sieve and the gaps between primes


About laborious

Interests in science, art, math, theory, game engines, future technology.
This entry was posted in Uncategorized. Bookmark the permalink.

Leave a Reply

Fill in your details below or click an icon to log in: Logo

You are commenting using your account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s