Since instead of just computing in a linear binary way, with the presence or absence of an electrical charge being converted into "bits" of zeros or ones, Quantum Computers can take the rich quantum properties of subatomic particles and turn them into "Qubits" that can be both zero and one at the same time. Quantum Computers could potentially run simulations and solve problems that are far too big for today's computers. But there is a catch: A Quantum Computer could also break public encryption keys used today to keep data safe. Quantum-readiness plan, providing advice about where vulnerabilities might be in the quantum-computer era, and strategies and tools that could be implemented now to make any transition into that era much easier.

1. Quantum Computers
New Generation of Computers
PART 9
QUANTUM COMPUTERS-
READINESS PLAN
Professor Lili Saghafi
Aug. 2015

2. Agenda
• QUANTUM COMPUTERS-READINESS PLAN
• RSA
• RSA problem
• SSL/TLS encryption
• (RLWE) problem
2

3. QUANTUM COMPUTERS-READINESS
PLAN
• Since instead of just computing in a linear binary way,
with the presence or absence of an electrical charge
being converted into "bits" of zeros or ones, Quantum
Computers can take the rich quantum properties of
subatomic particles and turn them into "Qubits" that
can be both zero and one at the same time.
• Quantum Computers could potentially run simulations
and solve problems that are far too big for today's
computers.
• But there is a catch: A Quantum Computer could also
break public encryption keys used today to keep data
safe.

5. QUANTUM-READINESS PLAN
• Quantum-readiness plan, providing advice
about where vulnerabilities might be in the
quantum-computer era, and strategies and
tools that could be implemented now to make
any transition into that era much easier.

6. RSA
• RSA is one of the first practical public-key
cryptosystems and is widely used for secure data
transmission. In such a cryptosystem, the encryption key is
public and differs from the decryption key which is kept
secret.
• In RSA, this asymmetry is based on the practical difficulty
of factoring the product of two large prime numbers,
the factoring problem. RSA is made of the initial letters of
the surnames of Ron Rivest, Adi Shamir and Leonard
Adleman, w
• ho first publicly described the algorithm in 1977. Clifford
Cocks, an English mathematician, had developed an
equivalent system in 1973, but it was not declassified until
1997.

8. RSA problem
• RSA problem , a user of RSA creates and then
publishes a public key based on the two
large prime numbers, along with an auxiliary
value. The prime numbers must be kept secret.
• Anyone can use the public key to encrypt a
message, but with currently published methods,
if the public key is large enough, only someone
with knowledge of the prime numbers can
feasibly decode the message.

10. RSA problem
• Breaking RSA encryption is known as the RSA
problem; whether it is as hard as the factoring
problem, it remains an open question.
• Quantum Computers are good for Data
encryption. Code are information in very large
number 768 bite number ,RSA code broken in
2010, it can take 3 years for Digital Computers.
1024 bite code number it takes 3000 years for
Digital Computers, and for Quantum Computers
in a minute.

11. RSA problem
• It was once believed that Quantum Computers could
only solve problems that had underlying mathematical
structures, such as code breaking.
• However, new algorithms have emerged that could
enable Quantum Machines to solve problems in fields
as diverse as weather prediction, materials science and
artificial intelligence.
• The ability of Quantum Computers to process massive
amounts of data in a relatively short amount of time
makes them extremely interesting to the scientific
community.

13. SSL/TLS encryption
• Now because of security vulnerability to
Quantum Computers , websites that use the
widespread SSL/TLS encryption standard
currently tend to make use of the RSA algorithm,
which mathematician Peter Shor showed in 1994
could be easily broken by a quantum computer.
• Shor’s approach could also be used to crack
elliptic curve cryptography, another primitive
increasingly used with SSL/TLS.

14. (RLWE) problem
• The research focuses on building a protocol using one
of the primitives currently thought to be difficult for
quantum computers to solve, called the “ring learning
with errors” (RLWE) problem.
• Practical application of this , is by seeing how to design
a key exchange protocol that’s suitable for use in
SSL/TLS and then implementing and testing it.
• Rather than multiplying large prime numbers together
as in RSA encryption, or using points on a curve as in
elliptic curve cryptography, here the mathematical
operation is based on multiplying polynomials
together, then adding some random noise.

16. RLWE
• The result makes it “much harder” to crack.
• RLWE hasn’t been studied intensively enough to prove
that it would be any more secure against quantum
computers than the techniques currently in use, but
the primitive seems to be one of the better bets
currently out there.
• If after years of cryptanalytic research no one manages
to break it, then it may achieve the corresponding
levels of confidence that the research community has
in the difficulty of currently accepted problems, like
factoring or elliptic curve discrete log.

18. Thank you!
Great Audience
Professor Lili Saghafi
proflilisaghafi@gmail.com
© Prof. Lili Saghafi , All Rights Reserved

19. References, Images Credit• SAP Market Place https://websmp102.sap-ag.de/HOME#wrapper
• Forbeshttp://www.forbes.com/sites/sap/2013/10/28/how-fashion-retailer-burberry-keeps-customers-coming-back-for-more/
• Youtube
• Professor Saghafi’s blog https://sites.google.com/site/professorlilisaghafi/
• TED Talks
• TEDXtalks
• http://www.slideshare.net/lsaghafi/
• Timo Elliot
• https://sites.google.com/site/psuircb/
• http://fortune.com/
• Theoretical Physicists John Preskill and Spiros Michalakis
• Institute for Quantum Computing https://uwaterloo.ca/institute-for-quantum-computing/
• quantum physics realisation Data-Burger, scientific advisor: J. Bobroff, with the support of : Univ. Paris Sud, SFP, Triangle de la Physique, PALM, Sciences à l'Ecole,
ICAM-I2CAM
• Max Planck Institute for Physics (MPP) http://www.mpg.de/institutes
• D-Wave Systems
• References
• Frank Wilczek. Physics in 100 Years. MIT-CTP-4654, URL = http://t.co/ezfHZdriUp
• William Benzon and David G. Hays. Computational Linguistics and the Humanist. Computers and the Humanities 10: 265 – 274, 1976. URL
=https://www.academia.edu/1334653/Computational_Linguistics_and_the_Humanist
• Stanislaw Ulam. Tribute to John von Neumann, 1903-1957. Bulletin of the American Mathematical Society. Vol64, No. 3, May 1958, pp. 1-49, URL = https://docs.google.com/file/d/0B-5-
JeCa2Z7hbWcxTGsyU09HSTg/edit?pli=1
• I have already discussed this sense of singualirty in a post on 3 Quarks Daily: Redefining the Coming Singularity – It’s not what you think, URL
= http://www.3quarksdaily.com/3quarksdaily/2014/10/evolving-to-the-future-the-web-of-culture.html
• David Hays and I discuss this in a paper where we set forth a number of such far-reaching singularities in cultural evolution: William Benzon and David G. Hays. The Evolution of
Cognition. Journal of Social and Biological Structures 13(4): 297-320, 1990, URL = https://www.academia.edu/243486/The_Evolution_of_Cognition
• Neurobiology of Language – Peter Hagoort on the future of linguistics, URL =http://www.mpi.nl/departments/neurobiology-of-language/news/linguistics-quo-vadis-an-outsider-
perspective
• See, for example: Alex Mesoudi, Cultural Evolution: How Darwinian Theory Can Explain Human Culture & Synthesize the Social Sciences, Chicago: 2011.
• Lewens, Tim, “Cultural Evolution”, The Stanford Encyclopedia of Philosophy (Spring 2013 Edition), Edward N. Zalta (ed.), URL
= http://plato.stanford.edu/archives/spr2013/entries/evolution-cultural/ Cultural evolution is a major interest of mine.
• Here’s a collection of publications and working papers, URL =https://independent.academia.edu/BillBenzon/Cultural-Evolution
• Helen Epstein. Music Talks: Conversations with Musicians. McGraw-Hill Book Company, 1987, p. 52.
• [discuss these ideas in more detail in Beethoven’s Anvil, Basic Books, 2001, pp. 47-68, 192-193, 206-210, 219-221, and in
• The Magic of the Bell: How Networks of Social Actors Create Cultural Beings, Working Paper, 2015, URL
=https://www.academia.edu/11767211/The_Magic_of_the_Bell_How_Networks_of_Social_Actors_Create_Cultural_Beings
19
© Prof. Lili Saghafi , All Rights Reserved