Cryptology Column Quantum Computing : The N,ncl of Classical Cryptography ? Gilles BRASSAR D Departement d'informatique et de H . O . Universite de Montrea l C .P . 6128, Succ . Centre-Vill e Montreal (Quebec ) CANADA I13C 3J 7 brassard©iro .umontreal .C A 31 October 199 4 1 Introductio n Can computers simulate physics? This question was asked in 1981 by Richard Fevnman i n his keynote address to the first Workshop on Physics of Computation [13] . This would hardl y have been an original question had he not asked more specifically if physics can be simulate d efficiently by classical computers . He gave reasons to believe the answer is negative . Thirteen years later, as the third Workshop on Physics and Computation is about to take plac e in Dallas (with yours truly as banquet speaker), we know that Feynman's intuition wa s .. correct provided factoring is genuinely difficult for classical computers . Specifically, Pete r Shor . building on work of Deutsch and .lozsa [11], Bernstein and Vazirani [5] and Simon [19] . has discovered how to factor arbitrarily large integers in polynomial time on a quantu m computer [18] .
End of preview. The entire article is 7 pages. To view the full-text, please rent this article to continue.
/lp/association-for-computing-machinery/quantum-computing-the-end-of-classical-cryptography-t6B3LZHxcr
Welcome to DeepDyve! Rent Premier Research Articles and Save Up to 90%
Quantum computing: the end of classical cryptography?
Brassard, Gilles
Follow ACM SIGACT News
, Volume 25 (4)
Association for Computing Machinery – Dec 1, 1994
More Info
More Like This Article
View All dataSource[]=actageo&dataSource[]=aspet&dataSource[]=aaos&dataSource[]=aacc&dataSource[]=aacr&dataSource[]=aea&dataSource[]=aip&dataSource[]=ajnr&dataSource[]=ams&dataSource[]=aps_physical&dataSource[]=appi_book&dataSource[]=appi_journal&dataSource[]=apha&dataSource[]=asip&dataSource[]=asm&dataSource[]=asn&dataSource[]=aspb&dataSource[]=avs&dataSource[]=annual_reviews&dataSource[]=arxiv&dataSource[]=acm&dataSource[]=berghahn&dataSource[]=cabi&dataSource[]=clinical_trials&dataSource[]=dailymed&dataSource[]=degruyter&dataSource[]=du_press&dataSource[]=esa&dataSource[]=eu_press&dataSource[]=elsevier&dataSource[]=emerald&dataSource[]=ejtr&dataSource[]=emea&dataSource[]=epo&dataSource[]=faseb&dataSource[]=gsa&dataSource[]=health_affairs&dataSource[]=hindawi&dataSource[]=imanager&dataSource[]=imedpub&dataSource[]=informa_healthcare&dataSource[]=informs&dataSource[]=iop&dataSource[]=iucr&dataSource[]=iospress&dataSource[]=jbjs&dataSource[]=leftcoast&dataSource[]=lu_press&dataSource[]=mesharpe&dataSource[]=mary_ann_liebert&dataSource[]=medline&dataSource[]=mit_press&dataSource[]=nature&dataSource[]=oxford&dataSource[]=pier_professional&dataSource[]=pnas&dataSource[]=portlandpress&dataSource[]=psyc_articles&dataSource[]=psyc_books&dataSource[]=psyc_critiques&dataSource[]=plos_journal&dataSource[]=pubmed_central&dataSource[]=rsna&dataSource[]=rockefeller&dataSource[]=rcn&dataSource[]=ria&dataSource[]=rsc&dataSource[]=sage&dataSource[]=spie&dataSource[]=springer_journal&dataSource[]=springer&dataSource[]=taylor_francis&dataSource[]=aps&dataSource[]=the_scientist&dataSource[]=uc_press&dataSource[]=uspto_abstract&dataSource[]=wiley&dataSource[]=pct
© 2012 DeepDyve, Inc. All rights reserved.
Terms of Service | Privacy Policy
