On the feasibility of single-trace attacks on the Gaussian sampler using a CDT

DOI10.1007/978-3-031-29497-6_8zbMath1526.94039OpenAlexW4360594888MaRDI QIDQ6088709

Soundes Marzougui, Juliane Krämer, Jean-Pierre Seifert, Ievgen Kabin, Thomas Aulbach

Publication date: 16 November 2023

Published in: Constructive Side-Channel Analysis and Secure Design (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-29497-6_8

zbMATH Keywords

side-channel analysispost-quantum cryptographypower analysismachine-learningFrodoKEMGaussian sampler

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Computer system organization (68M99) Quantum cryptography (quantum-theoretic aspects) (81P94)

Cites Work

• Unnamed Item
• Unnamed Item
• Efficiently masking binomial sampling at arbitrary orders for lattice-based crypto
• Faster multiplication in \(\mathbb{Z}_{2^m}[x\) on Cortex-M4 to speed up NIST PQC candidates]
• Provably Weak Instances of Ring-LWE Revisited
• Lattice Signatures and Bimodal Gaussians
• Analyzing the Shuffling Side-Channel Countermeasure for Lattice-Based Signatures
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Power Analysis Attacks
• FACCT: FAst, Compact, and Constant-Time Discrete Gaussian Sampler over Integers
• On lattices, learning with errors, random linear codes, and cryptography

This page was built for publication: On the feasibility of single-trace attacks on the Gaussian sampler using a CDT