Skip to main content
UploadLanguage (EN)Support
BusinessMobileSocial MediaMarketingTechnologyArt & PhotosCareerDesignEducationPresentations & Public SpeakingGovernment & NonprofitHealthcareInternetLawLeadership & ManagementAutomotiveEngineeringSoftwareRecruiting & HRRetailSalesServicesScienceSmall Business & EntrepreneurshipFoodEnvironmentEconomy & FinanceData & AnalyticsInvestor RelationsSportsSpiritualNews & PoliticsTravelSelf ImprovementReal EstateEntertainment & HumorHealth & MedicineDevices & HardwareLifestyle
Akshay Shelake, profile picture
Uploaded byAkshay Shelake
PPTX, PDF1,832 views

Quantum computer in cryptography

The document discusses quantum computing and its implications for cryptography, outlining the differences between classical and quantum computers, particularly in how they store and process information. It highlights the vulnerability of classical cryptography to advancements in technology and algorithms, while emphasizing the enhanced security offered by quantum cryptography based on the laws of quantum physics. Additionally, it reviews current developments in quantum key distribution and potential new cryptographic methods resistant to quantum attacks.

Technology◦
Downloaded 78 times
QUANTUM COMPUTER IN CRYPTOGRAPHY AKSHAY MAHADEO SHELAKE (T.Y.B.SC–COMP. SCI.)
Introduction • What is Quantum Computer? • The History of Quantum Computing • What is Cryptography ? • What are used todays Cryptography technology? • Computer Security Organizations and Quantum Computing
What is Quantum Computer ? • A quantum computer is a machine that performs calculations based on the laws of quantum mechanics, which is the behavior of particles at the sub-atomic level.
The History of Quantum Computing The idea of a quantum computer began in the early 1980s and was conceived by • Paul Benioff • Charles Bennett • David Deutsch • Richard Feynman • Yuri Manin
classical computers VS quantum computers The essence of the difference between classical computers and quantum computers is in the way information is stored and processed. In classical computers, information is represented on macroscopic level by bits, which can take one of the two values 0 or 1 In quantum computers, information is represented on microscopic level using qubits, (quantum bits) which can take on any from the following uncountable many values  | 0  + b | 1  where , b are arbitrary complex numbers such that |  | 2 + | b | 2 = 1.
Figure 3:Two-slit experiment Figure 4:Two-slit experiment with an observation Figure 1: Experiment with bullets Figure 2: Experiments with waves Classical Experiments VS Quantum Experiments
a,b  G , ak = b , find k Discrete logarithms (basis of DH crypto, including ECC): Integer Factorization (basis of RSA cryptography): Given N=pq, find p and q. Quantum Algorithms
Computational Complexity Comparison (in terms of number of group multiplications for n-bit inputs)
Scaling of number field sieve (NFS) on classical computers and Shor’s algorithm for factoring on a quantum computer, using Beckman- Chari-Devabhaktuni-Preskill modular exponentiation with various clock rates. Both horizontal and vertical axes are log scale.The horizontal axis is the size of the number being factored (Van Meter, Itoh, & Ladd, 2005).
What is Cryptography ? Transmitting information with access restricted to the intended recipient even if the message is intercepted by others. Cryptography is of increasing importance in our technological age using broadcast, network communications, Internet ,e-mail, cell phones which may transmit sensitive information related to finances, politics, business and private confidential matters
CLASSICAL versus QUANTUM CRYPTOGRAPHY Security of classical cryptography is based on unproven assumptions of computational complexity (and it can be jeopardize by progress in algorithms and/or technology). Security of quantum cryptography is based on laws of quantum physics that allow to build systems where undetectable eavesdropping is impossible Since classical cryptography is volnurable to technological improvements it has to be designed in such a way that a secret is secure with respect to future technology, during the whole period in which the secrecy is required. Quantum key generation, on the other hand, needs to be designed only to be secure against technology available at the moment of key generation.
public-key Cryptography • Encryption of data for many IT systems today relies on public-key cryptography. The concept of public-key cryptography was introduced by Whitfield Diffie and Martin Hellman in 1976 • This new method of encryption had two main purposes, encryption and digital signatures. It entails that each person (or communicating system) gets a pair of keys, one was dubbed the public key and the other was named the private key. • The public key is shared between the two parties and is used for identifying the end-user while the private key remains a secret and is never transmitted. Encrypted information is sent using the public key to identify the source but only a receiver that possesses the private key is able to decode the message. Unfortunately, the private key, while kept a secret from prying eyes, is linked to the public key through a mathematical algorithm
Company's developing QKD System • In 2002 - Swiss company called id Quantique • In 2003 -American company called MagiQ Technologies
Methods of Cryptography in Quantum Computer Cryptographers are discussing alternatives to today’s methods and have agreed that there are four major candidates that would provide immunity from a quantum computer attack. The four possible replacement methods include: - error-correcting codes - hash-functions - lattice cryptography systems - multivariate public-key cryptography system
Commercial quantum key distribution products exist Current State of Affairs
Current fiber- based distance record: 200 km (Takesue et al) Current State of Affairs
Demonstrated free-space link: 10 km Current State of Affairs
CONCLUSION Quantum cryptography ensure secure communication by providing security based on the fundamental law of physics, intend of the current state of mathematical algorithms or computing technology unlike classical encryption algorithm quantum cryptography does not depend factoring large integers into primes but on the fundamental principles of quantum physics. Quantum cryptography is more secure, because an intruder is not able to replicate the photon to recreate the key. Integrating QKD inTLS protocol will ensure financial transaction. Instead of using RSA, inTLS protocol .We can use Quantum Cryptography securely exchange the secret data and avoid an attack of intruder
References • Ajtai, M. (1998).The shortest vector problem in L2 is NP-hard randomized reductions. 30th ACM Symposium onTheory of Computing (pp. 10-19). NewYork: ACM. • Bacon, D., & Leung, D. (2007, September).Toward aWorld with Quantum Computers. Communications of the ACM, 50(9), pp 55-59. • Bernstein, D. J., Lange,T., & Peters, C. (2011). Wild McEliece. Lecture Notes in Computer Science, 6544/2011, 143-158. • Brown, J. R., & Deutsch, D. (2000).The quest for the quantum computer. NewYork, NY:Touchstone (Simon & Schuster, Inc.). • Deutsch, D., & Jozsa, R. (1992). Rapid Solution of Problems by Quantum Computation. Proceedings of the Royal Society of London SeriesA - Mathematical Physical and Engineering Sciences (pp. 553-558). London: Royal Society of London. • Diffie,W., & Hellman, M. E. (1976). New directions in cryptography. IEEETransactions on InformationTheory, 22(6), 644-654. • Ding, J., & Schmidt, D. (2006). Multivariable public key cryptosystems. Contemporary Mathematics(419), 79-94. • Docksai, R. (2011). Computers making the Quantum Leap. Futurist, 45(3), pp. 10-11. • Gershenfeld, N. A., & Chuang, I. L. (1997, January 17). Bulk Spin-Resonance Quantum Computation. Science, 275(5298), 350- 356. • Heger, M. (2009, January ). CryptographersTake On Quantum Computers. Retrieved July 24, 2011, from IEEE Spectrum: http://spectrum.ieee.org/computing/software/cryptographers-take-on-quantum-computers • IEEE Spectrum. (2008, November). Q&A with post-quantum computing cryptography researcher Jintai Ding. Retrieved Augu 8, 2011, from IEEE Spectrum: http://spectrum.ieee.org/computing/networks/qa-with-postquantum-computing-cryptography researcher-jintai-ding/0 • Jones, J. (1998). Fast searches with nuclear magnetic resonance computers. Science, 280(5361), 229. • Joye, M. (2009). Identity-based cryptography.Amsterdam: IOS Press • Kielpinski, D., Monroe, C., &Wineland, D. J. (2002, June 13). Architecture for a large-scale ion-trap quantum computer. Nature 417(6890), 709-711.
• Kleinjung,T., Aoki, K., Franke, J., Lenstra, A. K.,Thomé, E., Bos, J.W., et al. (2010, August). Factorization of a 768-bit RSA modulus. CRYPTO'10 Proceedings of the • 30th annual conference on Advances in cryptology (pp. 333-350). Berlin, Heidelberg: Springer-Verlag. • Lamport, L. (1979, October 18). Constructing digital signatures from a one-way function. InTechnical Report CSL-98. Menlo Park, CA: SRI International. • Merkle, R. C. (1988). A digital signature based on a convential encryption function. CRYPTO '87 A Conference on theTheory and Applications of CryptographicTechniques on Advances in Cryptology (pp. 369-378). London, UK: Springer-Verlag. • Moore's law. (n.d.).The American Heritage® Science Dictionary. Retrieved August 5, 2011, from Dictionary.com: http://dictionary.reference.com/browse/moore%27s%20law • Perlner, R. A., & Cooper, D. A. (2009). Quantum resistant public key cryptography: a survey. IDtrust '09 Proceedings of the 8th Symposium on Identity andTrust on the Internet (pp. 85-93). NewYork, NY: Association for Computing Machinery. • Shor, P. (1997). Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum. SIAM Journal on Computing, 26, 1484-1509. • Simmons,A. (2009, May 19). Quantum implications for IT security. ComputerWeekly, pp. 14-15. • Steane, A. (1996).The ion trap quantum information processor.Applied Physics B: Lasers and Optics, 64(6), 623-643. • van Emde Boas, P. (1981). Another NP-complete problem and the complexity of computing short vectors in a lattice. Netherlands: University of Amsterdam, Department of Mathematics. • Van Meter, R., Itoh, K. M., & Ladd,T. D. (2005). Architecture-Dependent ExecutionTime of Shor's Algorithm. Retrieved from EBSCOhost. • Vandersypen, L., Steffen, M., Breyta, G.,Yannoni, C., Sherwood, M., & Chuang, I. (2001, December). Experimental realization of Shor's quantum factoring algorithm using nuclear magnetic resonance. NATURE, 414(6866), 883-887. • Wood, L. (2010, December 17).The clock is ticking for encryption. Retrieved August 8, 2011, from Computerworld: http://www.computerworld.com/s/article/9201281/The_clock_is_ticking_on_encryption References