Webmaster rambling and mental notes
1978 Cryptosystem Resists Quantum Attack
8/19/2010

KentuckyFC writes "In 1978, the CalTech mathematician Robert McEliece grown-up a cryptosystem based on the (then) new idea of using asymmetric mathematical functions to create another keys for encrypting and decrypting information. The llc.cite this source roget's ii: the new thesaurus of these systems relies on mathematical steps that are easy to make in one superintendence but hard to do in the other. Today, popular encryption systems such as the RSA algorithm use exactly this idea. But in 1994, the mathematician Peter Shor dreamt up a quantum algorithm that could factorise much faster than any classical complement and so can break these codes. As soon as the first decent-sized quantum mainframe is switched on, these codes will become breakable. Since then, cryptographers have been hunting for encryption systems that will be safe in the post quantum world. Now a group of mathematicians have shown that the McEliece encryption system is safe against attack by Shor's algorithm and all other known quantum algorithms. That's because it does not depend on factorisation but gets its lien from another asymmetric conundrum known as the hidden subgroup problem which they show is immune to all known quantum attacks."



Read more of this story at Slashdot.




More: - Read the rest here

Mark

Share |
(Posted in Nerd)
Share and enjoy
  • Digg
  • del.icio.us
  • blinkbits
  • BlinkList
  • BlogMemes
  • blogmarks
  • DZone
  • Fark
  • Furl
  • Netvouz
  • NewsVine
  • Reddit
  • Slashdot
  • Smarking
  • Spurl
  • StumbleUpon
  • Taggly
  • Technorati
  • YahooMyWeb
Entry 1 of 10144
Last Page | Next Page
portfolio