Arithmetic coding and blinding countermeasures for lattice signatures
Explore this paper's citation graph
Summary
A practical, compact, and more quantum-resistant variant of the BLISS Ideal Lattice Signature Scheme is developed and it is demonstrated that arithmetic decoding from an uniform source to target distribution is also an optimal non-uniform sampling method in the sense that a minimal amount of true random bits is required.
- Type
- article
- Published
- 2017-01-21
- Cited by
- 63
- References
- 51
- OpenAlex
- https://openalex.org/W2571657973
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:4569150
Keywords
Arithmetic coding, Algorithm, Computer science, Huffman coding, Arithmetic
References
- Hardware-Optimized Ziggurat Algorithm for High-Speed Gaussian Random Number Generators
- Algorithms and Complexity: New Directions and Recent Results
- Public-Key Cryptography Standards (PKCS) #1: RSA Cryptography Specifications Version 2.1
- Sampling Exactly from the Normal Distribution
- First-order collision attack on protected NTRU cryptosystem
- Countermeasures against Power Analysis Attacks for the NTRU Public Key Cryptosystem
- A Fast, Easily Implemented Method for Sampling from Decreasing or Symmetric Unimodal Density Functions
- An Overview of the Basic Principles of the Q-Coder Adaptive Binary Arithmetic Coder
- Sampling from discrete Gaussians for lattice-based cryptography on a constrained device
- Generalized Kraft Inequality and Arithmetic Coding
- A fast quantum mechanical algorithm for database search
- Practical Lattice-Based Digital Signature Schemes
- An Automatic Inequality Prover and Instance Optimal Identity Testing
- The Ziggurat Method for Generating Random Variables
- GROVER'S QUANTUM SEARCHING ALGORITHM IS OPTIMAL
- Arithmetic coding for data compression
- NewHope without reconciliation
- SHA-3 Standard: Permutation-Based Hash and Extendable-Output Functions
- Updated Digital Signature Standard Approved as Federal Information Processing Standard (FIPS)186-3 | NIST
- From Schrödinger’s equation to the quantum search algorithm
Cited by
- Ring-LWE Ciphertext Compression and Error Correction: Tools for Lightweight Post-Quantum Cryptography
- To BLISS-B or not to be: Attacking strongSwan's Implementation of Post-Quantum Signatures
- Side-Channel Attacks on BLISS Lattice-Based Signatures: Exploiting Branch Tracing against strongSwan and Electromagnetic Emanations in Microcontrollers
- Special session paper: efficient arithmetic for lattice-based cryptography
- Compact, Scalable, and Efficient Discrete Gaussian Samplers for Lattice-Based Cryptography
- CDT-Based Gaussian Sampling: From Multi to Double Precision
- A Novel Algorithm for Bi-Level Image Coding and Lossless Compression based on Virtual Ant Colonies
- Binary Ring-LWE hardware with power side-channel countermeasures
- A rejection sampling algorithm for off-centered discrete Gaussian distributions over the integers
- Differential Fault Attacks on Deterministic Lattice Signatures
- Post-quantum algorithms for digital signing in Public Key Infrastructures
- Fault Attack Countermeasures for Error Samplers in Lattice-Based Cryptography
- Post-Quantum Lattice-Based Cryptography Implementations
- Selected Areas in Cryptography – SAC 2017
- An innovative design of a hybrid chain coding algorithm for bi-level image compression using an agent-based modeling approach
- An Innovative Chain Coding Technique for Compression Based on the Concept of Biological Reproduction: An Agent-Based Modeling Approach
- Special Issue on “Side Channel Attacks”
- Bounding the Cache-Side-Channel Leakage of Lattice-Based Signature Schemes Using Program Semantics
- Analyzing the Shuffling Side-Channel Countermeasure for Lattice-Based Signatures
- BEARZ Attack FALCON: Implementation Attacks with Countermeasures on the FALCON signature scheme
Related papers
- Arithmetic coding for data compression
- A formula based approach to Arithmetic Coding
- Data Compression Modelling: Huffman and Arithmetic
- An Efficient Compression Technique Using Arithmetic Coding
- Predictive data compression using adaptive arithmetic coding
- Adaptive arithmetic coding using fuzzy reasoning and grey prediction
- Android app for arithmetic encoding and decoding
- CMedia Compressor: An Application to Graphically Compare General Compression Algorithms and Adaptive Huffman Compression Algorithm