The Solace of Quantum; Cryptography  

Oleh:

[s.n]

Jenis: Article from Bulletin/Magazine
Dalam koleksi: The Economist (http://search.proquest.com/) vol. 407 no. 8837 (May 2013), page 73-74.
Topik: Cryptography; Quantum Physics; Public Key Infrastructure; Research & Development--R&D; Information Technology; Computer Security

Ketersediaan

Perpustakaan Pusat (Semanggi) Nomor Panggil: EE29.76 Non-tandon: 1 (dapat dipinjam: 0) Tandon: tidak ada

Lihat Detail Induk

Isi artikel

At the moment cryptography concentrates on making the decrypting part as hard as possible. The industry standard, known as RSA (after its inventors, Ron Rivest, Adi Shamir and Leonard Adleman, of the Massachusetts Institute of Technology), relies on two keys, one public and one private. These keys are very big numbers, each of which is derived from the product of the same two prime numbers. Anyone can encrypt a message using the public key, but only someone with the private key can decrypt it. To find the private key, you have to work out what the primes are from the public key. Make the primes big enough--and hunting big primes is something of a sport among mathematicians--and the task of factorising the public key to reveal the primes, though possible in theory, would take too long in practice. (About 40 quadrillion years with the primes then available, when the system was introduced in 1977.) Since the 1970s, though, the computers that do the factorisation have got bigger and faster. Some cryptographers therefore fear for the future of RSA. Hence the interest in quantum cryptography.

Opini Anda

Klik untuk menuliskan opini Anda tentang koleksi ini!

Kembali