Asosiy kontentga oʻtish
Maqola

Number-theoretic foundations of post-quantum cryptographic protocols

Osama RawiDepartment of Electrical & Electronic Engineering, College of Engineering, Gulf University, Sanad, 26489, Kingdom of BahrainM. ThamizhsudarDepartment of Humanities and Sciences (Mathematics Division), Aarupadai Veedu Institute of Technology, Vinayaka Mission’s Research Foundation (Deemed to be University), Paiyanoor, Chennai, Tamil Nadu, 603104, IndiaN. NivethaDepartment of Computer Science, Meenakshi College of Arts and Science, Meenakshi Academy of Higher Education and Research, Chennai, Tamil Nadu, 600078, IndiaVikram PatelMrunmai RanadeAlisher AbduvokhidovFaculty of Physics and Mathematics, Andijan State University, 129 University Street, Andijan, 170100, UzbekistanSardor SabirovDepartment of General Professional Sciences, Mamun University, Khiva, 220900, Uzbekistan
2026en
ABI

Annotatsiya

Conventional cryptographic systems such as factorization and discrete logarithm problems are threatened by the quick development of quantum computing.This paper offers a thorough study of number-theoretic problems and structures underlying post-quantum cryptographic protocols based on modular arithmetic, algebraic structures, lattices and computational hardness assumptions.The research is based on the mathematical problems of Learning with Errors (LWE) and Short Integer Solution (SIS) which are used for secure quantum-resistant encryption, digital signature and key exchange mechanisms.In secure communication scenarios, a framework of structured protocol is analyzed, which combines lattice-based operations and modular polynomial transformations.Experimental comparisons show that these schemes are not only practically efficient in computation but also have a level of security greater than 95% @ E-mail:

Hali tarjima qilinmagan

Identifikatorlar

Iqtiboslar va manbalar