a quantum of safety rooting trust in a quantum world
TRANSCRIPT
![Page 1: A QUANTUM OF SAFETY ROOTING TRUST IN A QUANTUM WORLD](https://reader031.vdocuments.net/reader031/viewer/2022012109/61dc5fc73c32be70e4342884/html5/thumbnails/1.jpg)
A QUANTUM OF SAFETYROOTING TRUST
IN A QUANTUM WORLD
Mark Pecen, COOJune 12, 2018
![Page 2: A QUANTUM OF SAFETY ROOTING TRUST IN A QUANTUM WORLD](https://reader031.vdocuments.net/reader031/viewer/2022012109/61dc5fc73c32be70e4342884/html5/thumbnails/2.jpg)
Agenda1. About quantum computing2. The impact of quantum computing on security3. Industry response to roots of trust issues
2
![Page 3: A QUANTUM OF SAFETY ROOTING TRUST IN A QUANTUM WORLD](https://reader031.vdocuments.net/reader031/viewer/2022012109/61dc5fc73c32be70e4342884/html5/thumbnails/3.jpg)
Quantum computing is the marriage of…
INFORMATION THEORY QUANTUM MECHANICS
![Page 4: A QUANTUM OF SAFETY ROOTING TRUST IN A QUANTUM WORLD](https://reader031.vdocuments.net/reader031/viewer/2022012109/61dc5fc73c32be70e4342884/html5/thumbnails/4.jpg)
By blending the two domains, we can calculate with certaintyusing the effects of uncertainty.
![Page 5: A QUANTUM OF SAFETY ROOTING TRUST IN A QUANTUM WORLD](https://reader031.vdocuments.net/reader031/viewer/2022012109/61dc5fc73c32be70e4342884/html5/thumbnails/5.jpg)
A classical bit is either 1 or 0A classical bit is like a light
bulb that’s either on or off
In a standard Von Neumann processor, we get one set of states per clock tick
5
0 “Off”
1 “On”
or
![Page 6: A QUANTUM OF SAFETY ROOTING TRUST IN A QUANTUM WORLD](https://reader031.vdocuments.net/reader031/viewer/2022012109/61dc5fc73c32be70e4342884/html5/thumbnails/6.jpg)
A quantum bit (qubit) is different• A quantum bit can exist in
multiple states simultaneously, like a light bulb that’s on and off at the same time
• Number of states = 2N, where N = number of qubits
• Example: A system with 16 qubitscan be in 216 = 65,536 states at once!
6
![Page 7: A QUANTUM OF SAFETY ROOTING TRUST IN A QUANTUM WORLD](https://reader031.vdocuments.net/reader031/viewer/2022012109/61dc5fc73c32be70e4342884/html5/thumbnails/7.jpg)
HOW IS THIS POSSIBLE?
![Page 8: A QUANTUM OF SAFETY ROOTING TRUST IN A QUANTUM WORLD](https://reader031.vdocuments.net/reader031/viewer/2022012109/61dc5fc73c32be70e4342884/html5/thumbnails/8.jpg)
There’s a better question…
How can we use this interesting property of
being in many states at once to solve important problems ?
Because the quantum computer lends itself to solving certain types of problems extremely easily.
8
![Page 9: A QUANTUM OF SAFETY ROOTING TRUST IN A QUANTUM WORLD](https://reader031.vdocuments.net/reader031/viewer/2022012109/61dc5fc73c32be70e4342884/html5/thumbnails/9.jpg)
9
IS QUANTUM COMPUTING FASTER?
It depends on the problem (…like the so-called travelling salesman problem.)
![Page 10: A QUANTUM OF SAFETY ROOTING TRUST IN A QUANTUM WORLD](https://reader031.vdocuments.net/reader031/viewer/2022012109/61dc5fc73c32be70e4342884/html5/thumbnails/10.jpg)
THE QUANTUMRACE IS ON
![Page 11: A QUANTUM OF SAFETY ROOTING TRUST IN A QUANTUM WORLD](https://reader031.vdocuments.net/reader031/viewer/2022012109/61dc5fc73c32be70e4342884/html5/thumbnails/11.jpg)
Quantum computing will solve today’s unsolvable problems, opening up
A NEW REALM OF POSSIBILITIES.
![Page 12: A QUANTUM OF SAFETY ROOTING TRUST IN A QUANTUM WORLD](https://reader031.vdocuments.net/reader031/viewer/2022012109/61dc5fc73c32be70e4342884/html5/thumbnails/12.jpg)
CHEMISTRY
QUANTUM COMPUTING WILL REVOLUTIONIZE
MANY INDUSTRIES
BIG DATA
MACHINE LEARNING
CRYPTOGRAPHYMATERIAL DESIGN
WEATHER SERVICES
![Page 13: A QUANTUM OF SAFETY ROOTING TRUST IN A QUANTUM WORLD](https://reader031.vdocuments.net/reader031/viewer/2022012109/61dc5fc73c32be70e4342884/html5/thumbnails/13.jpg)
THE CHALLENGEQuantum computing will break today’s
public key encryption standards.
![Page 14: A QUANTUM OF SAFETY ROOTING TRUST IN A QUANTUM WORLD](https://reader031.vdocuments.net/reader031/viewer/2022012109/61dc5fc73c32be70e4342884/html5/thumbnails/14.jpg)
EFFECT ON TODAY’S CRYPTOGRAPHY
Type Algorithm Key StrengthClassic (bits)
Key Strength Quantum (bits)
Quantum Attack
Asymmetric
RSA 2048 112
0 Shor’sAlgorithm
RSA 3072 128
ECC 256 128
ECC 521 256
SymmetricAES 128 128 64 Grover’s
AlgorithmAES 256 256 128
![Page 15: A QUANTUM OF SAFETY ROOTING TRUST IN A QUANTUM WORLD](https://reader031.vdocuments.net/reader031/viewer/2022012109/61dc5fc73c32be70e4342884/html5/thumbnails/15.jpg)
Data ExchangeHandshake
Secure Communication Protocol
AuthenticationKey Establishment AES 256 AES 128
Symmetric Encryption Grover’s algorithm reduces the effective
symmetric key size to half
Shor’s algorithm breaks current
public-key algorithms
IMPACT ON SECURE COMMINICATIONS
![Page 16: A QUANTUM OF SAFETY ROOTING TRUST IN A QUANTUM WORLD](https://reader031.vdocuments.net/reader031/viewer/2022012109/61dc5fc73c32be70e4342884/html5/thumbnails/16.jpg)
IMPACT ON SOFTWARE UPDATES
Software UpdateDigital Signature
• Create software update• Digitally sign the update
Embed a Root of Trust at Manufacture
• Receive software update• Verify ECDSA or RSA digital signature• Apply software update
→ broken using Shor’s algorithm
![Page 17: A QUANTUM OF SAFETY ROOTING TRUST IN A QUANTUM WORLD](https://reader031.vdocuments.net/reader031/viewer/2022012109/61dc5fc73c32be70e4342884/html5/thumbnails/17.jpg)
PATHWAYS TO QUANTUM SAFETY
Quantum Key Distribution
Quantum-Safe Cryptography
![Page 18: A QUANTUM OF SAFETY ROOTING TRUST IN A QUANTUM WORLD](https://reader031.vdocuments.net/reader031/viewer/2022012109/61dc5fc73c32be70e4342884/html5/thumbnails/18.jpg)
THE “NEW” MATH
Hash-based
Isogeny-based
Multivariate-based
Code-based
Lattice-based
![Page 19: A QUANTUM OF SAFETY ROOTING TRUST IN A QUANTUM WORLD](https://reader031.vdocuments.net/reader031/viewer/2022012109/61dc5fc73c32be70e4342884/html5/thumbnails/19.jpg)
Introduced by Merkle in 1979
“One-Time Signatures”
Small public key but very large private key
Fast signing & verifying & stateful
Became practical by combining all verification keys into a single Public Key
And it happens to be quantum-safe
Candidates: Leighton-Micali Signatures (LMS) eXtended Merkle Signature Scheme (XMSS)
Verification Keys
Signing Keys
Y1
X1
Y2
X2
Y3
X3
Y4
X4
Y5
X5
Y6
X6
Y7
X7
Y8
X8
A3,1 A3,2 A3,3 A3,4 A3,5 A3,6 A3,7 A3,8
A2,1 A2,2 A2,3 A2,4
A1,2 A1,2
A0Public Key
Tree Height = 3
Example Signature Solution: Quantum-Safe Hash-Based Signatures
![Page 20: A QUANTUM OF SAFETY ROOTING TRUST IN A QUANTUM WORLD](https://reader031.vdocuments.net/reader031/viewer/2022012109/61dc5fc73c32be70e4342884/html5/thumbnails/20.jpg)
20
SUCCESS REQUIRES
STANDARDS
![Page 21: A QUANTUM OF SAFETY ROOTING TRUST IN A QUANTUM WORLD](https://reader031.vdocuments.net/reader031/viewer/2022012109/61dc5fc73c32be70e4342884/html5/thumbnails/21.jpg)
USING STATEFUL HASH-BASED SIGNATURES The math is mature to be used
ETSI Working Group QSC was first to characterize these signatures
IETF is in the final stages of specification
NIST will standardize stateful hashes for code signing
ISARA successfully impended LMS and XMSS on an HSM
The implementation uses tree reduction and state management
Trees of height 20 provide million+ signatures
![Page 22: A QUANTUM OF SAFETY ROOTING TRUST IN A QUANTUM WORLD](https://reader031.vdocuments.net/reader031/viewer/2022012109/61dc5fc73c32be70e4342884/html5/thumbnails/22.jpg)
CLEARING THE PATH TOQUANTUM-SAFE SECURITY
Join us on social@ISARACorp @ISARACorp @ISARA Corporation
![Page 23: A QUANTUM OF SAFETY ROOTING TRUST IN A QUANTUM WORLD](https://reader031.vdocuments.net/reader031/viewer/2022012109/61dc5fc73c32be70e4342884/html5/thumbnails/23.jpg)
Mark Pecen• Mark Pecen, Chief Operating Officer of ISARA Corporation, which develops
security libraries for next‐generation networks and computing platforms. • Chairman of the European Telecommunication Standards Institute (ETSI) TC
Cyber Working Group for Quantum Safe Cryptography (QSC), in Sophia Antipolis, FRANCE
• Former senior executive for BlackBerry, Ltd. where he founded the Advanced Technology Research Centre and developed a significant portion of BlackBerry’s wireless and networking patent portfolio
• Awarded the title of Motorola Distinguished Innovator and Science Advisory Board member for developing valuable intellectual property for cellular wireless communication – managed professional services for clients in Europe and North America
• Inventor on over 100 patents of technologies adopted globally and used in everyday wireless services, including for the Global System for Mobile Telecommunication (GSM), Universal Mobile Telecommunication System (UMTS), High‐Speed Packet Access (HSPA+), Long‐Term Evolution (LTE) for 4G wireless and others
• Serves on boards of Mobiquity, Safeguard Scientifics, Rocket Wagon, Swift Labs, Ontario Centres of Excellence, University of Waterloo Institute for Quantum Computing, Wilfred Laurier University School of Business
• Graduate of the University of Pennsylvania, Wharton School of Business and School of Engineering and Applied Sciences