Breaking the Hardness Assumption and IND-CPA Security of HQC Submitted to NIST PQC Project

DOI10.1007/978-3-030-00434-7_17MaRDI QIDQ6104632zbMATH OpenFDO

Authors Zhen Liu, Yanbin Pan

Publication date 28 June 2023

Published in Cryptology and Network Security (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-00434-7_17

zbMATH Keywords

\(s\)-DQCSD problemcoding theoryHQCIND-CPApost-quantum cryptography

Mathematics Subject Classification ID

Quantum cryptography (quantum-theoretic aspects) (81P94) Cryptography (94A60)

Recommendations

• A new decryption failure attack against HQC
• A timing attack on the HQC encryption scheme
• A new key recovery side-channel attack on HQC with chosen ciphertext
• A power side-channel attack on the Reed-Muller Reed-Solomon version of the HQC cryptosystem
• Cryptanalysis of LEDAcrypt

Cites work

• scientific article; zbMATH DE number 6433928 (Why is no real title available?)
• On lattices, learning with errors, random linear codes, and cryptography
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

Cited in

(5)

• A gapless code-based hash proof system based on RQC and its applications
• A new decryption failure attack against HQC
• Towards automating cryptographic hardware implementations: a case study of HQC
• A gapless post-quantum hash proof system in the Hamming metric
• Efficient error-correcting codes for the HQC post-quantum cryptosystem

This page was built for publication: Breaking the Hardness Assumption and IND-CPA Security of HQC Submitted to NIST PQC Project

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6104632)