SoK: how (not) to design and implement post-quantum cryptography (Q826276)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	SoK: how (not) to design and implement post-quantum cryptography	scientific article

Statements

scholarly article

0 references

SoK: how (not) to design and implement post-quantum cryptography (English)

0 references

0 references

0 references

0 references

publication date

20 December 2021

0 references

zbMATH Keywords

signatures

0 references

key-establishment schemes

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-030-75539-3_19

0 references

0 references

0 references

On the concrete hardness of learning with errors

0 references

Ciphers for MPC and FHE

0 references

Estimate all the {LWE, NTRU} schemes!

0 references

Security of hedged Fiat-Shamir signatures under fault attacks

0 references

Improving stateless hash-based signatures

0 references

An Improved Compression Technique for Signatures Based on Learning with Errors

0 references

Merkle's key agreement protocol is optimal: an \(O(n^2)\) attack on any key agreement from random oracles

0 references

Masking the GLP lattice-based signature scheme at any order

0 references

Concretely-Efficient Zero-Knowledge Arguments for Arithmetic Circuits and Their Application to Lattice-Based Cryptography

0 references

Banquet: short and fast signatures from AES

0 references

New directions in nearest neighbor searching with applications to lattice sieving

0 references

The Exact Security of Digital Signatures-How to Sign with RSA and Rabin

0 references

Post-Quantum Cryptography

0 references

SPHINCS: Practical Stateless Hash-Based Signatures

0 references

Practical implementation of Ring-SIS/LWE based signature and IBE

0 references

Solving polynomial systems over finite fields

0 references

Sigma protocols for MQ, PKP and SIS, and fishy signature schemes

0 references

LegRoast: Efficient Post-quantum Signatures from the Legendre PRF

0 references

CSI-FiSh: efficient isogeny based signatures through class group computations

0 references

Public key compression for constrained linear signature schemes

0 references

PKP-based signature scheme

0 references

Quantum security analysis of CSIDH

0 references

Assessing the feasibility of single trace power analysis of Frodo

0 references

Decoding linear codes with high error rate and its impact for LPN security

0 references

Flush, Gauss, and reload -- a cache attack on the BLISS lattice-based signature scheme

0 references

On the Security of the Winternitz One-Time Signature Scheme

0 references

Grafting trees: a fault attack against the SPHINCS framework

0 references

CSIDH: an efficient post-quantum commutative group action

0 references

Message-recovery laser fault injection attack on the \textit{classic McEliece} cryptosystem

0 references

Tight and optimal reductions for signatures based on average trapdoor preimage sampleable functions and applications to code-based signatures

0 references

An efficient quantum collision search algorithm and implications on symmetric cryptography

0 references

From 5-Pass $$\mathcal {MQ}$$-Based Identification to $$\mathcal {MQ}$$-Based Signatures

0 references

Approximate trapdoors for lattices and smaller hash-and-sign signatures

0 references

Small solutions to polynomial equations, and low exponent RSA vulnerabilities

0 references

0 references

0 references

0 references

LWE with side information: attacks and concrete security estimation

0 references

0 references

(One) failure is not an option: bootstrapping the search for failures in lattice-based encryption schemes

0 references

The impact of error dependencies on Ring/Mod-LWE/LWR based schemes

0 references

Decryption failure attacks on IND-CCA secure lattice-based schemes

0 references

SeaSign: compact isogeny signatures from class group actions

0 references

Towards practical key exchange from ordinary isogeny graphs

0 references

SQISign: compact post-quantum signatures from quaternions and isogenies

0 references

BBQ: using AES in Picnic signatures

0 references

Wave: a new family of trapdoor one-way preimage sampleable functions based on codes

0 references

Two attacks on rank metric code-based schemes: RankSign and an IBE scheme

0 references

On the Joint Security of Encryption and Signature in EMV

0 references

The XL-Algorithm and a Conjecture from Commutative Algebra

0 references

New directions in cryptography

0 references

Linear equivalence of block ciphers with partial non-linear layers: application to LowMC

0 references

Efficient Identity-Based Encryption over NTRU Lattices

0 references

Learning a Zonotope and More: Cryptanalysis of NTRUSign Countermeasures

0 references

A public key cryptosystem and a signature scheme based on discrete logarithms

0 references

0 references

A Distinguisher for High-Rate McEliece Cryptosystems

0 references

Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies

0 references

How To Prove Yourself: Practical Solutions to Identification and Signature Problems

0 references

Affine Masking against Higher-Order Side Channel Analysis

0 references

RankSign: An Efficient Signature Algorithm Based on the Rank Metric

0 references

On the Security of Supersingular Isogeny Cryptosystems

0 references

Trapdoors for hard lattices and new cryptographic constructions

0 references

0 references

0 references

0 references

0 references

Practical Lattice-Based Cryptography: A Signature Scheme for Embedded Systems

0 references

A key-recovery timing attack on post-quantum primitives using the Fujisaki-Okamoto transformation and its application on FrodoKEM

0 references

A Key Recovery Attack on MDPC with CCA Security Using Decoding Errors

0 references

A novel CCA attack using decryption errors against LAC

0 references

Limits on the efficiency of (ring) LWE-based non-interactive key exchange

0 references

0 references

0 references

0 references

0 references

A modular analysis of the Fujisaki-Okamoto transformation

0 references

SoK: how (not) to design and implement post-quantum cryptography

0 references

Benchmarking Post-quantum Cryptography in TLS

0 references

Advances in Cryptology - CRYPTO 2003

0 references

W-OTS+ – Shorter Signatures for Hash-Based Signature Schemes

0 references

0 references

Towards Quantum-Resistant Cryptosystems from Supersingular Elliptic Curve Isogenies

0 references

Quantum cryptanalysis in the RAM model: claw-finding attacks on SIKE

0 references

Implementing Grover oracles for quantum key search on AES and LowMC

0 references

A crossbred algorithm for solving Boolean polynomial systems

0 references

A Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup Problem

0 references

Another Subexponential-time Quantum Algorithm for the Dihedral Hidden Subgroup Problem

0 references

Finding shortest lattice vectors faster using quantum search

0 references

Side channel information set decoding using iterative chunking. Plaintext recovery from the ``Classic McEliece'' hardware reference implementation

0 references

Worst-case to average-case reductions for module lattices

0 references

Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures

0 references

On Ideal Lattices and Learning with Errors over Rings

0 references

Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller

0 references

Masking Dilithium. Efficient implementation and side-channel evaluation

0 references

Learning a Parallelepiped: Cryptanalysis of GGH and NTRU Signatures

0 references

Template Attacks on Masking—Resistance Is Futile

0 references

Cold boot attacks on NTRU

0 references

A Decade of Lattice Cryptography

0 references

He gives C-sieves on the CSIDH

0 references

How (Not) to Instantiate Ring-LWE

0 references

Lattice Cryptography for the Internet

0 references

Algebraically structured LWE. Revisited

0 references

Security Proofs for Signature Schemes

0 references

On lattices, learning with errors, random linear codes, and cryptography

0 references

0 references

A method for obtaining digital signatures and public-key cryptosystems

0 references

A Side-Channel Assisted Cryptanalytic Attack Against QcBits

0 references

On Provable Security of UOV and HFE Signature Schemes against Chosen-Message Attack

0 references

Public-Key Identification Schemes Based on Multivariate Quadratic Polynomials

0 references

A reaction attack against cryptosystems based on LRPC codes

0 references

Breaking Ed25519 in WolfSSL

0 references

0 references

Lattice basis reduction: Improved practical algorithms and solving subset sum problems

0 references

A new identification scheme based on syndrome decoding

0 references

A new paradigm for public key identification

0 references

Advances in Cryptology - EUROCRYPT 2004

0 references

Analysis of Information Set Decoding for a Sub-linear Error Weight

0 references

Parallel collision search with cryptanalytic applications

0 references

Improved identification schemes based on error-correcting codes

0 references

All in the XL Family: Theory and Practice

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-030-75539-3_19

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:826276

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q826276&oldid=36752232"