To BLISS-B or not to be - Attacking strongSwan's Implementation of Post-Quantum Signatures

Peter Peßl, Leon Groot Bruinderink, Yuval Yarom

Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

Abstract

In the search for post-quantum secure alternatives to RSA and ECC, lattice-based cryptography appears to be an attractive and efficient option. A particularly interesting lattice-based signature scheme is BLISS, offering key and signature sizes in the range of RSA moduli. A range of works on efficient implementations of BLISS is available, and the scheme has seen a first real-world adoption in strongSwan, an IPsec-based VPN suite. In contrast, the implementation-security aspects of BLISS, and lattice-based cryptography in general, are still largely unexplored.
At CHES 2016, Groot Bruinderink et al. presented the first side-channel attack on BLISS, thus proving that this topic cannot be neglected. Nevertheless, their attack has some limitations. First, the technique is demonstrated via a proof-of-concept experiment that was not performed under realistic attack settings. Furthermore, the attack does not apply to BLISS-B, an improved variant of BLISS and also the default option in strongSwan. This problem also applies to later works on implementation security of BLISS.
In this work, we solve both of the above problems. We present a new side-channel key-recovery algorithm against both the original BLISS and the BLISS-B variant. Our key-recovery algorithm draws on a wide array of techniques, including learning-parity with noise, integer programs, maximimum likelihood tests, and a lattice-basis reduction. With each application of a technique, we reveal additional information on the secret key culminating in a complete key recovery.
Finally, we show that cache attacks on post-quantum cryptography are not only possible, but also practical. We mount an asynchronous cache attack on the production-grade BLISS-B implementation of strongSwan. The attack recovers the secret signing key after observing roughly 6000 signature generations.
Original languageEnglish
Title of host publicationCCS 2017
PublisherAssociation of Computing Machinery
DOIs
Publication statusPublished - 2017

Fingerprint

Recovery
Cryptography
Quantum cryptography
Experiments
Side channel attack

Keywords

  • lattice-based cryptography
  • side-channel analysis
  • signatures
  • cache attacks
  • learning parity with noise
  • lattice reduction

Cite this

Peßl, P., Groot Bruinderink, L., & Yarom, Y. (2017). To BLISS-B or not to be - Attacking strongSwan's Implementation of Post-Quantum Signatures. In CCS 2017 Association of Computing Machinery. https://doi.org/10.1145/3133956.3134023

To BLISS-B or not to be - Attacking strongSwan's Implementation of Post-Quantum Signatures. / Peßl, Peter; Groot Bruinderink, Leon; Yarom, Yuval.

CCS 2017. Association of Computing Machinery, 2017.

Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

Peßl, Peter ; Groot Bruinderink, Leon ; Yarom, Yuval. / To BLISS-B or not to be - Attacking strongSwan's Implementation of Post-Quantum Signatures. CCS 2017. Association of Computing Machinery, 2017.
@inproceedings{e3d079fdfa4c4849a9829844f13b8ec6,
title = "To BLISS-B or not to be - Attacking strongSwan's Implementation of Post-Quantum Signatures",
abstract = "In the search for post-quantum secure alternatives to RSA and ECC, lattice-based cryptography appears to be an attractive and efficient option. A particularly interesting lattice-based signature scheme is BLISS, offering key and signature sizes in the range of RSA moduli. A range of works on efficient implementations of BLISS is available, and the scheme has seen a first real-world adoption in strongSwan, an IPsec-based VPN suite. In contrast, the implementation-security aspects of BLISS, and lattice-based cryptography in general, are still largely unexplored.At CHES 2016, Groot Bruinderink et al. presented the first side-channel attack on BLISS, thus proving that this topic cannot be neglected. Nevertheless, their attack has some limitations. First, the technique is demonstrated via a proof-of-concept experiment that was not performed under realistic attack settings. Furthermore, the attack does not apply to BLISS-B, an improved variant of BLISS and also the default option in strongSwan. This problem also applies to later works on implementation security of BLISS. In this work, we solve both of the above problems. We present a new side-channel key-recovery algorithm against both the original BLISS and the BLISS-B variant. Our key-recovery algorithm draws on a wide array of techniques, including learning-parity with noise, integer programs, maximimum likelihood tests, and a lattice-basis reduction. With each application of a technique, we reveal additional information on the secret key culminating in a complete key recovery.Finally, we show that cache attacks on post-quantum cryptography are not only possible, but also practical. We mount an asynchronous cache attack on the production-grade BLISS-B implementation of strongSwan. The attack recovers the secret signing key after observing roughly 6000 signature generations.",
keywords = "lattice-based cryptography, side-channel analysis, signatures, cache attacks, learning parity with noise, lattice reduction",
author = "Peter Pe{\ss}l and {Groot Bruinderink}, Leon and Yuval Yarom",
year = "2017",
doi = "10.1145/3133956.3134023",
language = "English",
booktitle = "CCS 2017",
publisher = "Association of Computing Machinery",
address = "United States",

}

TY - GEN

T1 - To BLISS-B or not to be - Attacking strongSwan's Implementation of Post-Quantum Signatures

AU - Peßl, Peter

AU - Groot Bruinderink, Leon

AU - Yarom, Yuval

PY - 2017

Y1 - 2017

N2 - In the search for post-quantum secure alternatives to RSA and ECC, lattice-based cryptography appears to be an attractive and efficient option. A particularly interesting lattice-based signature scheme is BLISS, offering key and signature sizes in the range of RSA moduli. A range of works on efficient implementations of BLISS is available, and the scheme has seen a first real-world adoption in strongSwan, an IPsec-based VPN suite. In contrast, the implementation-security aspects of BLISS, and lattice-based cryptography in general, are still largely unexplored.At CHES 2016, Groot Bruinderink et al. presented the first side-channel attack on BLISS, thus proving that this topic cannot be neglected. Nevertheless, their attack has some limitations. First, the technique is demonstrated via a proof-of-concept experiment that was not performed under realistic attack settings. Furthermore, the attack does not apply to BLISS-B, an improved variant of BLISS and also the default option in strongSwan. This problem also applies to later works on implementation security of BLISS. In this work, we solve both of the above problems. We present a new side-channel key-recovery algorithm against both the original BLISS and the BLISS-B variant. Our key-recovery algorithm draws on a wide array of techniques, including learning-parity with noise, integer programs, maximimum likelihood tests, and a lattice-basis reduction. With each application of a technique, we reveal additional information on the secret key culminating in a complete key recovery.Finally, we show that cache attacks on post-quantum cryptography are not only possible, but also practical. We mount an asynchronous cache attack on the production-grade BLISS-B implementation of strongSwan. The attack recovers the secret signing key after observing roughly 6000 signature generations.

AB - In the search for post-quantum secure alternatives to RSA and ECC, lattice-based cryptography appears to be an attractive and efficient option. A particularly interesting lattice-based signature scheme is BLISS, offering key and signature sizes in the range of RSA moduli. A range of works on efficient implementations of BLISS is available, and the scheme has seen a first real-world adoption in strongSwan, an IPsec-based VPN suite. In contrast, the implementation-security aspects of BLISS, and lattice-based cryptography in general, are still largely unexplored.At CHES 2016, Groot Bruinderink et al. presented the first side-channel attack on BLISS, thus proving that this topic cannot be neglected. Nevertheless, their attack has some limitations. First, the technique is demonstrated via a proof-of-concept experiment that was not performed under realistic attack settings. Furthermore, the attack does not apply to BLISS-B, an improved variant of BLISS and also the default option in strongSwan. This problem also applies to later works on implementation security of BLISS. In this work, we solve both of the above problems. We present a new side-channel key-recovery algorithm against both the original BLISS and the BLISS-B variant. Our key-recovery algorithm draws on a wide array of techniques, including learning-parity with noise, integer programs, maximimum likelihood tests, and a lattice-basis reduction. With each application of a technique, we reveal additional information on the secret key culminating in a complete key recovery.Finally, we show that cache attacks on post-quantum cryptography are not only possible, but also practical. We mount an asynchronous cache attack on the production-grade BLISS-B implementation of strongSwan. The attack recovers the secret signing key after observing roughly 6000 signature generations.

KW - lattice-based cryptography

KW - side-channel analysis

KW - signatures

KW - cache attacks

KW - learning parity with noise

KW - lattice reduction

U2 - 10.1145/3133956.3134023

DO - 10.1145/3133956.3134023

M3 - Conference contribution

BT - CCS 2017

PB - Association of Computing Machinery

ER -