Robert McEliece Quantum Proof Code

What zyprexa for order you can doIf you notice gastrointestinal side effects after getting nasonex sale your dose of Shingrix, talk with your doctor. For people azor no rx with anxiety about leaving the house, chronic medical conditions that clonidine no prescription make catching infections dangerous, and contagious diseases, remote care may buy cialis online cheap mean the difference between prompt treatment and no treatment at viagra pharmacy all. Excessive pressure may become dangerous if a person is griseofulvin vendors unable to sense it and effectively communicate their comfort level. generic toradol The NHS explains that certain types of bowel polyps, called buy generic flovent adenomas, have a small risk of becoming cancerous. However, this lasix for order article should not be used as a substitute for the buy generic tetracycline alternative liquid knowledge and expertise of a licensed healthcare professional. If tattoo cheap prescription without consultation zofran order professionals follow the correct guidelines and aseptic techniques, and if people.

Nobody has built a quantum computer much more powerful than a pocket calculator but that hasn’t stopped people worrying about the implications of the post-quantum computing world. Most worried are the people who rely on cryptographic codes to protect sensitive information. When the first decent-sized quantum computer is switched on, previously secure codes such as the commonly used RSA algorithm will become instantly breakable.

Which is why cryptographers are scurrying about looking for codes that will be secure in the post-quantum world. Today, Hang Dinh at the University of Connecticut and a couple of pals show that cryptographers have been staring at one all along. They say that a little-used code developed by the CalTech mathematician Robert McEliece in 1978 can resist all known attacks by quantum computers.

First, let’s a make a distinction between symmetric and asymmetric codes. Symmetric codes use identical keys for encrypting and decrypting a message. Quantum computers can dramatically speed up an attack against these kinds of codes. However, symmetric codes have some protection. Doubling the size of the key counteracts this speed up. So it is possible for code makers to stay ahead of the breakers, at least in theory. (Although in practice, the safe money would be on the predator in this cat and mouse game. )

.:technologyreview.com->

email

Post to Twitter Post to Facebook

Posted: August 30th, 2010
at 8:35am by Koookiecrumbles


Categories: security

Comments: No comments



 

Leave a Reply