Saved in:
Bibliographic Details
Main Authors: Aizpurua, Borja, Patra, Siddhartha, Martinez, Josu Etxezarreta, Orus, Roman
Format: Preprint
Published: 2024
Subjects:
Online Access:https://arxiv.org/abs/2409.04125
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866911076462886912
author Aizpurua, Borja
Patra, Siddhartha
Martinez, Josu Etxezarreta
Orus, Roman
author_facet Aizpurua, Borja
Patra, Siddhartha
Martinez, Josu Etxezarreta
Orus, Roman
contents Here we introduce the application of Tensor Networks (TN) to launch attacks on symmetric-key cryptography. Our approaches make use of Matrix Product States (MPS) as well as our recently-introduced Flexible-PEPS Quantum Circuit Simulator (FQCS). We compare these approaches with traditional brute-force attacks and Variational Quantum Attack Algorithm (VQAA) methods also proposed by us. Our benchmarks include the Simplified Data Encryption Standard (S-DES) with 10-bit keys, Simplified Advanced Encryption Standard (S-AES) with 16-bit keys, and Blowfish with 32-bit keys. We find that for small key size, MPS outperforms VQAA and FQCS in both time and average iterations required to recover the key. As key size increases, FQCS becomes more efficient in terms of average iterations compared to VQAA and MPS, while MPS remains the fastest in terms of time. These results highlight the potential of TN methods in advancing quantum cryptanalysis, particularly in optimizing both speed and efficiency. Our results also show that entanglement becomes crucial as key size increases.
format Preprint
id arxiv_https___arxiv_org_abs_2409_04125
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Hacking Cryptographic Protocols with Tensor Network Attacks
Aizpurua, Borja
Patra, Siddhartha
Martinez, Josu Etxezarreta
Orus, Roman
Quantum Physics
Here we introduce the application of Tensor Networks (TN) to launch attacks on symmetric-key cryptography. Our approaches make use of Matrix Product States (MPS) as well as our recently-introduced Flexible-PEPS Quantum Circuit Simulator (FQCS). We compare these approaches with traditional brute-force attacks and Variational Quantum Attack Algorithm (VQAA) methods also proposed by us. Our benchmarks include the Simplified Data Encryption Standard (S-DES) with 10-bit keys, Simplified Advanced Encryption Standard (S-AES) with 16-bit keys, and Blowfish with 32-bit keys. We find that for small key size, MPS outperforms VQAA and FQCS in both time and average iterations required to recover the key. As key size increases, FQCS becomes more efficient in terms of average iterations compared to VQAA and MPS, while MPS remains the fastest in terms of time. These results highlight the potential of TN methods in advancing quantum cryptanalysis, particularly in optimizing both speed and efficiency. Our results also show that entanglement becomes crucial as key size increases.
title Hacking Cryptographic Protocols with Tensor Network Attacks
topic Quantum Physics
url https://arxiv.org/abs/2409.04125