Quantum-Resistant Encryption For Secure End-to-End Communication

Cryptographically Relevant Quantum Computers (CRQCs) are no longer hypothetical; they present significant challenges to current IT infrastructure by potentially breaking existing encryption schemes within minutes. This paper introduces an innovative and efficient method for achieving quantum-resistant encryption through lattice-based cryptography. We specifically tackle the challenge of encrypting extremely small units of data, such as a single letter or a single-bit message, by constructing a multidimensional lattice. Our proposed technique leverages the Short Vector Problem (SVP) in lattice-based cryptography and incorporates the Learning with Errors (LWE) methodology for data encryption and decryption. We demonstrate the feasibility and robustness of this approach using a real-time messaging application that provides quantum-resistant end-to-end encryption. Our work has the potential for deployment in strategic applications, securing information from the “harvest now, decrypt later” threat, even in the presence of quantum technologies.

Authors

Institutions

Publication Details

Published
2024-10-21
DOI
https://doi.org/10.23919/ituk62727.2024.10772922
Citations
1
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
0.35
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Quantum-Resistant Encryption For Secure End-to-End Communication

Jawar Singh, Jadhav Neha Kishor, Singh Dilip, Sandeep Kumar et al.
1 citations
Quantum Computing Algorithms and Architecture
0.35
article

Quantum-Resistant Encryption For Secure End-to-End Communication

Jawar Singh, Jadhav Neha Kishor, Singh Dilip, Sandeep Kumar, Kant Sameer
article en
1 citations

Abstract

Cryptographically Relevant Quantum Computers (CRQCs) are no longer hypothetical; they present significant challenges to current IT infrastructure by potentially breaking existing encryption schemes within minutes. This paper introduces an innovative and efficient method for achieving quantum-resistant encryption through lattice-based cryptography. We specifically tackle the challenge of encrypting extremely small units of data, such as a single letter or a single-bit message, by constructing a multidimensional lattice. Our proposed technique leverages the Short Vector Problem (SVP) in lattice-based cryptography and incorporates the Learning with Errors (LWE) methodology for data encryption and decryption. We demonstrate the feasibility and robustness of this approach using a real-time messaging application that provides quantum-resistant end-to-end encryption. Our work has the potential for deployment in strategic applications, securing information from the “harvest now, decrypt later” threat, even in the presence of quantum technologies.

Indian Institute of Technology Patna (IN), Government of India (IN)
Openalex Percentile: Top 31%
Quantum Computing Algorithms and Architecture
0.35
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Quantum-Resistant Encryption For Secure End-to-End Communication — Jawar Singh, Jadhav Neha Kishor, et al. · (2024) | TGRS Research Map | TGRS