Higher-order masked Saber

DOI10.1007/978-3-031-14791-3_5zbMATH Open1518.94076OpenAlexW4294698993MaRDI QIDQ6134812FDOQ6134812

Authors: Suparna Kundu, Jan-Pieter D'Anvers, Michiel Van Beirendonck, Angshuman Karmakar, Ingrid Verbauwhede 

Publication date: 25 July 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-14791-3_5

Recommendations

• Masking Dilithium. Efficient implementation and side-channel evaluation
• A lightweight implementation of Saber resistant against side-channel attacks
• How fast can higher-order masking be in software?
• Masking large keys in hardware: a masked implementation of McEliece
• A masked ring-LWE implementation

zbMATH Keywords

post-quantum cryptographyhigher-order maskingSaberkey-encapsulation mechanism

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Quantum cryptography (quantum-theoretic aspects) (81P94) Authentication, digital signatures and secret sharing (94A62)

Cites Work

• Title not available (Why is that?)
• Keccak
• Saber: module-LWR based key exchange, CPA-secure encryption and CCA-secure KEM
• A method for obtaining digital signatures and public-key cryptosystems
• Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems
• Secure integration of asymmetric and symmetric encryption schemes
• Title not available (Why is that?)
• Title not available (Why is that?)
• Towards sound approaches to counteract power-analysis attacks
• Topics in Cryptology – CT-RSA 2005
• Cryptographic Hardware and Embedded Systems - CHES 2004
• Masking the GLP lattice-based signature scheme at any order
• A modular analysis of the Fujisaki-Okamoto transformation
• A key-recovery timing attack on post-quantum primitives using the Fujisaki-Okamoto transformation and its application on FrodoKEM
• Faster multiplication in \(\mathbb{Z}_{2^m}[x]\) on Cortex-M4 to speed up NIST PQC candidates
• Timing Attacks on NTRUEncrypt Via Variation in the Number of Hash Calls
• Title not available (Why is that?)
• A masked ring-LWE implementation
• Efficiently masking binomial sampling at arbitrary orders for lattice-based crypto
• Secure Conversion between Boolean and Arithmetic Masking of Any Order

Cited In (5)

• Efficiently masking polynomial inversion at arbitrary order
• A lightweight implementation of Saber resistant against side-channel attacks
• One-hot conversion: towards faster table-based A2B conversion
• Fast first-order masked NTTRU
• A message recovery attack on LWE/LWR-based PKE/KEMs using amplitude-modulated EM emanations

This page was built for publication: Higher-order masked Saber

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