Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
[PDF][PDF] Status report on the third round of the NIST post-quantum cryptography standardization process
Abstract The National Institute of Standards and Technology is in the process of selecting
publickey cryptographic algorithms through a public, competition-like process. The new …
publickey cryptographic algorithms through a public, competition-like process. The new …
[PDF][PDF] CRYSTALS-Kyber algorithm specifications and supporting documentation
• Increase noise parameter for Kyber512 In the round-2 submission of Kyber, the decryption
error for Kyber512 was rather conservative, while at the same time, there were requests to …
error for Kyber512 was rather conservative, while at the same time, there were requests to …
Quantum-safe cryptography: crossroads of coding theory and cryptography
We present an overview of quantum-safe cryptography (QSC) with a focus on post-quantum
cryptography (PQC) and information-theoretic security. From a cryptographic point of view …
cryptography (PQC) and information-theoretic security. From a cryptographic point of view …
The complexity of the shortest vector problem
H Bennett - ACM SIGACT News, 2023 - dl.acm.org
Computational problems on point lattices play a central role in many areas of computer
science including integer programming, coding theory, cryptanalysis, and especially the …
science including integer programming, coding theory, cryptanalysis, and especially the …
Fast reduction of algebraic lattices over cyclotomic fields
We describe two very efficient polynomial-time algorithms for reducing module lattices
defined over arbitrary cyclotomic fields that solve the γ-Hermite Module-SVP problem. They …
defined over arbitrary cyclotomic fields that solve the γ-Hermite Module-SVP problem. They …
Learning with quantization: Construction, hardness, and applications
S Lyu, L Liu, C Ling - Cryptology ePrint Archive, 2024 - eprint.iacr.org
This paper presents a generalization of the Learning With Rounding (LWR) problem, initially
introduced by Banerjee, Peikert, and Rosen, by applying the perspective of vector …
introduced by Banerjee, Peikert, and Rosen, by applying the perspective of vector …
Overflow-detectable floating-point fully homomorphic encryption
A floating-point fully homomorphic encryption (FPFHE) is proposed, which is based on torus
fully homomorphic encryption equipped with programmable bootstrap**. Specifically …
fully homomorphic encryption equipped with programmable bootstrap**. Specifically …
A fully classical LLL algorithm for modules
G De Micheli, D Micciancio - Cryptology ePrint Archive, 2022 - eprint.iacr.org
The celebrated LLL algorithm for Euclidean lattices is central to cryptanalysis of well-known
and deployed protocols as it provides approximate solutions to the Shortest Vector Problem …
and deployed protocols as it provides approximate solutions to the Shortest Vector Problem …
Coupling bit and modular arithmetic for efficient general-purpose fully homomorphic encryption
Fully Homomorphic Encryption (FHE) enables computation directly on encrypted data. This
property is desirable for outsourced computation of sensitive data as it relies solely on the …
property is desirable for outsourced computation of sensitive data as it relies solely on the …
Lattice-based Cryptography: A survey on the security of the lattice-based NIST finalists
K de Boer, W van Woerden - Cryptology ePrint Archive, 2025 - eprint.iacr.org
This survey, mostly written in the years 2022-2023, is meant as an as short as possible
description of the current state-of-the-art lattice attacks on lattice-based cryptosystems …
description of the current state-of-the-art lattice attacks on lattice-based cryptosystems …