Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

On Structure-Preserving Cryptography and Lattices

Dennis Hofheinz, Kristina Hostáková, Roman Langrehr, Bogdan Ursu

Published Jan 1, 2024• 0 citations
Publisher
DOI
10.1007/978-3-031-57725-3_9

Related papers

Hardness of Structured Lattice Problems for Post-Quantum Cryptography

Joël Felderhoff

•Nov 26, 2024•0 citations

An Extensive Study on Lattice-Based Cryptography and its Applications for RLWE-Based Problems

Sonam Yadav

Lattice-based cryptography has emerged as a powerful paradigm for constructing secure cryptographic primitives, offering resistance to quantum attacks and providing a versatile framework for building post-quantum cryptographic systems. This research paper provides an in-depth exploration of lattice-based cryptography, focusing specifically on its applications for problems based on Ring Learning with Errors (RLWE). We analyze the fundamental concepts of lattice theory, delve into the RLWE problem, and highlight the security properties and challenges associated with lattice-based schemes. Furthermore, we discuss various real-world applications of lattice-based cryptography, demonstrating its potential for secure communication, privacy-preserving protocols, and post-quantum cryptography.

Universal Research Reports•Sep 23, 2023•3 citations

Lattice-Based Cryptographic Constructions

S Zaky Mohamed

•Jul 26, 2026•0 citations

On the Phase Dynamics and Asymptotic Boundary Constraints of Lattice-Based Post-Quantum Cryptography

Nick Farhat

This preprint paper introduces a novel linear transformation framework to investigate the phase dynamics and asymptotic boundary constraints of Lattice-Based Post-Quantum Cryptography, specifically targeting the Module Learning With Errors (M-LWE) hardness assumptions. Abstract: We investigate the phase behavior of high-dimensional geometric lattice execution paths within the Module Learning With Errors (M-LWE) configuration space under parameter deformation. By introducing a two-dimensional unitary transformation matrix D_L modeled on structural gravitational field balance dynamics, we evaluate phase deviations and net rotational shearing torque away from the symmetric secure baseline. Our geometric analysis demonstrates that the strict requirement of coordinate area preservation (unitarity) forces the matrix determinant to equal 1, implying that local phase deviations must vanish identically on secure parameter tracks. This structural constraint proves by contradiction that implementation leakage or structural noise asymmetries introduce a strictly positive gradient (dτ_L/dΔ > 0) that collapses the matrix determinant, establishing a rigid, scale-invariant boundary condition that maps hidden vulnerabilities in post-quantum key generation algorithms.

•Oct 4, 2026•0 citations

Cryptographic Protocols from Lattices

Eike Kiltz

Lecture notes in computer science•Jan 1, 2010•0 citations

Some Recent Progress in Lattice-Based Cryptography

Chris Peikert

Lecture notes in computer science•Jan 1, 2009•32 citations
Lattice-based cryptography has emerged as a powerful paradigm for constructing secure cryptographic primitives, offering resistance to quantum attacks and providing a versatile framework for building post-quantum cryptographic systems. This research paper provides an in-depth exploration of lattice-based cryptography, focusing specifically on its applications for problems based on Ring Learning with Errors (RLWE). We analyze the fundamental concepts of lattice theory, delve into the RLWE problem, and highlight the security properties and challenges associated with lattice-based schemes. Furthermore, we discuss various real-world applications of lattice-based cryptography, demonstrating its potential for secure communication, privacy-preserving protocols, and post-quantum cryptography.
This preprint paper introduces a novel linear transformation framework to investigate the phase dynamics and asymptotic boundary constraints of Lattice-Based Post-Quantum Cryptography, specifically targeting the Module Learning With Errors (M-LWE) hardness assumptions. Abstract: We investigate the phase behavior of high-dimensional geometric lattice execution paths within the Module Learning With Errors (M-LWE) configuration space under parameter deformation. By introducing a two-dimensional unitary transformation matrix D_L modeled on structural gravitational field balance dynamics, we evaluate phase deviations and net rotational shearing torque away from the symmetric secure baseline. Our geometric analysis demonstrates that the strict requirement of coordinate area preservation (unitarity) forces the matrix determinant to equal 1, implying that local phase deviations must vanish identically on secure parameter tracks. This structural constraint proves by contradiction that implementation leakage or structural noise asymmetries introduce a strictly positive gradient (dτ_L/dΔ > 0) that collapses the matrix determinant, establishing a rigid, scale-invariant boundary condition that maps hidden vulnerabilities in post-quantum key generation algorithms.