The Future of Computer Security - Stony Brook …Bits: 1 or 0 Qubits: 1, 0, or both “Spooky action...

15
The Future of Computer Security Privacy and Security in the Quantum Age Ian Buitenkant

Transcript of The Future of Computer Security - Stony Brook …Bits: 1 or 0 Qubits: 1, 0, or both “Spooky action...

Page 1: The Future of Computer Security - Stony Brook …Bits: 1 or 0 Qubits: 1, 0, or both “Spooky action at a distance” - multiple qubits are not independent → we can perform multiple

The Future of Computer Security

Privacy and Security in the Quantum Age

Ian Buitenkant

Page 2: The Future of Computer Security - Stony Brook …Bits: 1 or 0 Qubits: 1, 0, or both “Spooky action at a distance” - multiple qubits are not independent → we can perform multiple

What is Security?“The state of being free from danger or threat”

In the context of computer security:

Keeping data (and sometimes hardware) safe from being exposed, tampered with, or destroyed

Page 3: The Future of Computer Security - Stony Brook …Bits: 1 or 0 Qubits: 1, 0, or both “Spooky action at a distance” - multiple qubits are not independent → we can perform multiple

Encryption: keeping data hiddenEncryption relies on “trapdoor” functions:

One way is easy, the other way is hard...

Factor(21) = {3,7}

Factor(26) = {2,13}

Factor(6895601) = {1931,3571} Unless you know the secret!

6895601➗3571 = 1931 (very easy)

Page 4: The Future of Computer Security - Stony Brook …Bits: 1 or 0 Qubits: 1, 0, or both “Spooky action at a distance” - multiple qubits are not independent → we can perform multiple

EncryptionGiven plaintext P, key k, function f, and ciphertext C, encryption might look like this:

f(P,k) = {C}P to C -- apply the function on the Plaintext and the key (encryption)

1931 x 3571 = 6895601

C to P -- apply another function on the Ciphertext and the key (decryption)

6895601 ➗ 3571 = 1931 f’(C,k) = {P}

Page 5: The Future of Computer Security - Stony Brook …Bits: 1 or 0 Qubits: 1, 0, or both “Spooky action at a distance” - multiple qubits are not independent → we can perform multiple

Quantum ComputersBits: 1 or 0

Qubits: 1, 0, or both

“Spooky action at a distance” - multiple qubits are not independent → we can perform multiple actions simultaneously

Shor’s algorithm: efficient factorization

Page 6: The Future of Computer Security - Stony Brook …Bits: 1 or 0 Qubits: 1, 0, or both “Spooky action at a distance” - multiple qubits are not independent → we can perform multiple

Should we worry?Largest prime factorization problem ever solved by a QC? 291311

Fairly small. Modern encryption: hundreds of digits

Is there any way to tell how fast QCs will become?

Currently have a 20-qubit at IBM for experiments

Page 7: The Future of Computer Security - Stony Brook …Bits: 1 or 0 Qubits: 1, 0, or both “Spooky action at a distance” - multiple qubits are not independent → we can perform multiple

SolutionsPost-quantum encryption:

Better trapdoor functions to rely on (lattice encryption)

Better understanding of the limits of quantum computers

Infinite in every direction: difficult to reason about even with classical computation

Page 8: The Future of Computer Security - Stony Brook …Bits: 1 or 0 Qubits: 1, 0, or both “Spooky action at a distance” - multiple qubits are not independent → we can perform multiple

Privacy

Page 9: The Future of Computer Security - Stony Brook …Bits: 1 or 0 Qubits: 1, 0, or both “Spooky action at a distance” - multiple qubits are not independent → we can perform multiple

PrivacyHow much do we willingly share?

Contact info, relationships, physical address, personal information.

Is it reasonable to sacrifice privacy for convenience?

To what extent?

Page 10: The Future of Computer Security - Stony Brook …Bits: 1 or 0 Qubits: 1, 0, or both “Spooky action at a distance” - multiple qubits are not independent → we can perform multiple

PrivacyHow much do we unknowingly share?

Google knows more about you than you think

Sending physical tracking data from a phone

Able to discern location, time, and speed

Page 11: The Future of Computer Security - Stony Brook …Bits: 1 or 0 Qubits: 1, 0, or both “Spooky action at a distance” - multiple qubits are not independent → we can perform multiple

Speaking of Google, how much trust do we place in 3rd party organizations

Equifax security breach: 143 million exposed, 200,000+ credit cards

Trust

https://www.csoonline.com/article/3260191/security/healthcare-experiences-twice-the-number-of-cyber-attacks-as-other-industries.html

Medical facilities: Large amounts of personal data stored. Increasingly becoming the targets of cyber attacks

Page 12: The Future of Computer Security - Stony Brook …Bits: 1 or 0 Qubits: 1, 0, or both “Spooky action at a distance” - multiple qubits are not independent → we can perform multiple

PerceptionHead of Security at Equifax: Master’s in Fine Arts and Music Composition, UGA

Large gap in supply/demand for security professionals

Programming vs Security

Social perception of cybercrime

Page 13: The Future of Computer Security - Stony Brook …Bits: 1 or 0 Qubits: 1, 0, or both “Spooky action at a distance” - multiple qubits are not independent → we can perform multiple

The Future of SecurityTechnology growth is accelerating more than ever before

More software/hardware → more opportunities for cyber crime

Both fields are growing at different rates

Asymmetry principal:

Attacker only needs 1 opening, defender needs to find/fix all of them

Page 14: The Future of Computer Security - Stony Brook …Bits: 1 or 0 Qubits: 1, 0, or both “Spooky action at a distance” - multiple qubits are not independent → we can perform multiple

What can you do?Use safer passwords: don’t reuse them

Be wary of public WiFi (even on the right connection)

Read EULAs: https://tosdr.org/ Community project to make ToS documents more readable and accessible