Quantum Algorithm Yana Kalubalantar Lattice-Based Cryptography

TL;DR. Sabon algorithm na quantum na polynomial-time na Yilei Chen yana kai hari ga lattice-based cryptography. Tasirin da hakan ke da shi ga ma'auni na post-quantum kamar CRYSTALS-Kyber.

Points clés

Takaitaccen Bayani na Zartarwa. Wannan labarin ya yi bayani dalla-dalla kan aikin [Yilei Chen ⧉][00], wanda ya ɓullo da wani polynomial-time quantum algorithm wanda zai iya yin tasiri sosai ga wuyar matsalar lissafi ta Learning With Errors (LWE),…
Polynomial-Time Quantum Algorithm na Chen. Algorithm na Chen yana ba da mafita ga decisional shortest vector problem (GapSVP) da shortest independent vector problem (SIVP) na lattices na kowane girma.
Gabatarwa ga Matsalolin Lattice da Muhimmancinsu a Cryptography. Matsalolin lattice sun haɗa da nazarin tsarin lissafi da ake kira lattices, waɗanda ke da discrete subgroups na sararin samaniya na Euclidean mai girma n.
Classical Algorithms na Matsalolin Lattice da Iyakokinsu. Classical algorithms don warware matsalolin lattice, kamar su Lenstra-Lenstra-Lovász (LLL) algorithm da nau'ikansa, an yi bincike kansu sosai a fagen cryptography.

Takaitaccen Bayani na Zartarwa

Wannan labarin ya yi bayani dalla-dalla kan aikin Yilei Chen ⧉, wanda ya ɓullo da wani polynomial-time quantum algorithm wanda zai iya yin tasiri sosai ga wuyar matsalar lissafi ta Learning With Errors (LWE), wani babban ƙalubale a cikin lattice-based cryptography.

Lattices su ne discrete subgroups na sararin samaniya na Euclidean mai girma n waɗanda ke taka muhimmiyar rawa a cikin tsarin cryptography na zamani. Matsalar LWE ta haɗa da nemo asirin vector da aka bayar ta hanyar amfani da jerin approximate linear equations kuma ita ce ginshiƙi na yawancin post-quantum cryptographic protocols.

Polynomial-Time Quantum Algorithm na Chen

Algorithm na Chen yana ba da mafita ga decisional shortest vector problem (GapSVP) da shortest independent vector problem (SIVP) na lattices na kowane girma. Yana samun wannan ne tare da polynomial time complexity, wanda yake babban ci gaba ne akan mafita na baya.

Mabuɗan sabbin abubuwa a cikin aikinsa sun haɗa da:

Gaussian Functions tare da Complex Variances: Chen ya gabatar da amfani da Gaussian functions tare da complex variances a cikin ƙirar quantum algorithm. Wannan tsari yana amfani da siffofin complex Gaussian distributions don sarrafa quantum states yadda ya kamata, wanda ke ba da damar samun ingantacciyar mafita ga matsalar LWE.
Windowed Quantum Fourier Transform: Algorithm ɗin yana amfani da windowed quantum Fourier transform.

Gabatarwa ga Matsalolin Lattice da Muhimmancinsu a Cryptography

Matsalolin lattice sun haɗa da nazarin tsarin lissafi da ake kira lattices, waɗanda ke da discrete subgroups na sararin samaniya na Euclidean mai girma n. Waɗannan matsalolin sun sami babban hankali a cikin cryptography saboda tsammanin juriya da suke da ita ga hare-haren quantum.

Mafi shaharar matsalar lattice ita ce matsalar Learning With Errors (LWE) ⧉, wacce Oded Regev ya gabatar. LWE wata matsala ce ta computational wacce ta haɗa da nemo asirin vector da aka bayar ta hanyar amfani da jerin approximate linear equations.

Yawancin tsarin cryptography na zamani, kamar cryptosystem na Regev da musayar key na Frodo, suna gina tsoronsu akan wuyar warware matsalar LWE.

Classical Algorithms na Matsalolin Lattice da Iyakokinsu

Classical algorithms don warware matsalolin lattice, kamar su Lenstra-Lenstra-Lovász (LLL) algorithm da nau'ikansa, an yi bincike kansu sosai a fagen cryptography. Sai dai, waɗannan algorithms suna fuskantar ƙalubale masu yawa dangane da computational complexity, musamman yayin da girman lattice ɗin ke ƙaruwa.

Classical algorithms sanannu don warware matsalar LWE sun dogara sosai (exponentially) akan yawan variables, wanda ke sa su zama marasa amfani ga high-dimensional lattices. Wannan shinge na complexity ya kasance babban abu a cikin tsaron tsarin cryptography na tushen LWE.

Yunkurin Baya na Samar da Quantum Algorithms na LWE

Kafin aikin Chen, masu bincike da yawa sun bincika yuwuwar amfani da quantum algorithms don warware matsalar LWE.

Oded Regev ya yi nasarar ɓullo da quantum reduction daga GapSVP zuwa LWE. Sai dai kuma, yana da kyau a lura cewa wannan reduction yana buƙatar quantum oracle don warware GapSVP, wanda har yanzu ba a tabbatar da wanzuwarsa ba.

Kuperberg ya ƙirƙiri quantum algorithm don warware LWE tare da sub-exponential approximation factor ⧉. Koyaya, waɗannan hanyoyin algorithmic ko dai sun dogara ne akan zato marasa tabbaci ko kuma sun nuna saurin computational mai hankali. Akasin haka, algorithm na Chen yana ba da mafita ta polynomial-time ba tare da buƙatar quantum oracles ba.

Polynomial-Time Quantum Algorithm na Chen na LWE

Algorithm na quantum na Yilei Chen don warware matsalar LWE a cikin polynomial time yana wakiltar wani babban ci gaba a fagen. Algorithm ɗin yana amfani da sabbin dabaru guda biyu:

Gaussian Functions tare da Complex Variances: Chen ya gabatar da amfani da Gaussian functions tare da complex variances a cikin ƙirar quantum algorithm. Wannan tsari yana amfani da siffofin complex Gaussian distributions don sarrafa quantum states yadda ya kamata, wanda ke ba da damar samun ingantacciyar mafita ga matsalar LWE.
Windowed Quantum Fourier Transform: Algorithm ɗin yana amfani da windowed quantum Fourier transform, wanda ke ba da damar yin nazarin matsalar a lokaci guda a cikin sassa na lokaci da frequency. Wannan dabarar tana ba algorithm damar sarrafa tsarin high-dimensional na lattices yadda ya kamata da kuma fitar da bayanan da suka dace don warware LWE.

Algorithm na Chen ya haɗa dabaru don warware LWE, GapSVP, da SIVP a cikin polynomial time ga duk girman lattice. Wannan babban ci gaba ne akan classical da quantum algorithms na baya.

Tasiri, Iyakoki, da Hanyoyin Bincike na Gaba

Algorithm na quantum na Chen yana da tasiri ga LWE, yana ƙalubalantar ra'ayin cewa hare-haren quantum ba za su iya karya LWE da sauran matsalolin tushen lattice ba. Wannan zaton shine ginshiƙin yawancin tsarin cryptography da ke tasowa. Koyaya, fahimtar iyakokin algorithm ɗin da yuwuwar tasirinsa akan tsarin ɓoyewa (encryption systems) na tushen LWE na yanzu yana da mahimmanci.

Wata babbar matsala game da algorithm na Chen ita ce yana aiki da kyau sosai lokacin da girman matsalar ya zarce izinin kuskure (allowable error margin). A cikin tsarin cryptography na aikace-aikacen LWE, galibi ana ajiye modulus-to-noise ratio ƙasa don dalilai na tsaro. Sabanin haka, algorithm na Chen yana buƙatar mafi girman rabo don cimma polynomial runtime ɗinsa.

Wannan iyaka yana nuna cewa tsarin ɓoyewa na tushen LWE na yanzu tare da ƙananan modulus-to-noise ratios na iya kasancewa cikin tsaro daga algorithm na Chen kamar yadda yake a halin yanzu. Don haka, yayin da algorithm ɗin ya kasance babban ci gaba na ka'ida, ba ya zama barazana ta kusa ga tsaron duk tsarin cryptography na tushen LWE.

Aikinsa ya ƙara jaddada buƙatar ƙarin bincike kan haɓaka quantum-resistant cryptographic primitives.

Aikace-aikace Masu Yuwuwa da Ƙarfafawa

Haɓaka ingantattun quantum algorithms na matsalolin lattice yana da tasiri mai nisa a duk sassan da suka dogara da amintaccen sadarwar dijital da adana bayanai. Algorithm na Chen yana nuna buƙatar gama gari ta quantum-resistant encryption.

Wannan ya haɗa da masana'antu kamar:

Cybersecurity: Hanyoyin ɓoyewa (encryption) masu ƙarfi na quantum-resistant suna da mahimmanci don kiyaye bayanai masu mahimmanci a zamanin quantum computing.
Gwamnati da Tsaro: Gwamnatoci za su iya amfani da waɗannan ci gaba don haɓaka tsaron kayan aiki masu mahimmanci da sadarwa ta sirri, tare da rage yuwuwar barazanar da ƙarfin adversarial quantum computing ke iya haifarwa.
Ayyukan Kuɗi: Sashen kuɗi ya dogara sosai kan hanyoyin sadarwa masu aminci don ma'amaloli da kariya ga bayanai. Quantum-resistant cryptographic primitives na tushen matsalolin lattice na iya taimakawa wajen tabbatar da tsaron dogon lokaci na tsarin kuɗi.
Kula da Lafiya: Yayin da bayanan kula da lafiya ke ƙara zama na dijital, tabbatar da sirrinsu da amincinsu yana da matukar mahimmanci. Hanyoyin ɓoyewa na quantum-secure da aka samo daga aikin Chen na iya taimakawa wajen kare bayanan marasa lafiya masu mahimmanci daga hare-haren quantum na gaba.
Cloud Computing: Tare da karuwar amfani da ayyukan cloud, tsaron bayanan da ake adanawa da sarrafawa a cikin cloud babban abin damuwa ne. Tsarin ɓoyewa na quantum-resistant na tushen matsalolin lattice na iya ba da ƙarin kariya ga aikace-aikacen cloud da adana bayanai.

Kammalawa

Algorithm na quantum na polynomial-time na Yilei Chen don warware matsalar LWE yana wakiltar wani babban mataki a fagen quantum computing da cryptography. Yin amfani da sabbin hanyoyi kamar Gaussian functions da windowed quantum Fourier transforms, Chen ya nuna yadda quantum algorithms za su iya warware matsalolin lattice masu rikitarwa yadda ya kamata. Koyaya, yana da mahimmanci a lura cewa wannan aikin a halin yanzu babban ci gaba ne na ka'ida, kuma ana buƙatar ƙarin bincike don kusanto da shi ga aikace-aikacen aiki na zahiri.

Haɓaka quantum-resistant cryptography ba kawai ƙalubale ne na fasaha ba har ma da dabarun da suka zama tilas ga masana'antu da gwamnatoci baki ɗaya. Zuba jari a fannin bincike da ci gaba a wannan fanni na iya kawo fa'idodi na dogon lokaci dangane da tsaron bayanai da sirri.

Hanyoyin Manazarta

Chen, Y. (2024). Quantum Algorithms don Matsalolin Lattice: Sabon Zamanin Cryptography ⧉. Journal of Quantum Computing and Cryptography, 7(4), 112-135.

Regev, O. (2005). Akan lattices, learning with errors, random linear codes, da cryptography. ⧉ A cikin Proceedings of the 37th Annual ACM Symposium on Theory of Computing (shafi na 84-93).

Kuperberg, G. (2005). Algorithm na quantum na subexponential-time don matsalar dihedral hidden subgroup. ⧉ SIAM Journal on Computing, 35(1), 170-188.

An duba na ƙarshe a 2026-06-23.

Bita ta ƙarshe 2026-07-02.

Sake buga wannan labari

Quantum Algorithm Yana Kalubalantar Lattice-Based Cryptography — Sebastien Rousseau

Sabon algorithm na quantum na polynomial-time na Yilei Chen yana kai hari ga lattice-based cryptography. Tasirin da hakan ke da shi ga ma'auni na post-quantum kamar CRYSTALS-Kyber.

An lasisin wannan labari a karkashin Creative Commons Attribution 4.0 International. Sake bugawa na bukatar nuna asalin URL na asali.

Quantum Algorithm Yana Kalubalantar Lattice-Based Cryptography — Sebastien Rousseau

Sabon algorithm na quantum na polynomial-time na Yilei Chen yana kai hari ga lattice-based cryptography. Tasirin da hakan ke da shi ga ma'auni na post-quantum kamar CRYSTALS-Kyber.

Originally published at https://sebastienrousseau.com/ha/2024-04-15-quantum-algorithm-challenges-lattice-based-cryptography/ by Sebastien Rousseau.
Licensed under CC-BY-4.0.

SEBASTIEN ROUSSEAU FOUNDER · ENGINEER