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

Indonesian Journal of Electrical Engineering and Computer Science

An overview of number theory research unit variant development security

Saba Alaa Abdulwahhab, Qasim Mohammed Hussein, Imad Fakhri Taha Alshaikhli

Published Sep 21, 2022• 2 citations
Publisher

Abstract

Number theory research unit (NTRU) become the most important of securi-ty in recent, with its modification of their variant, this paper search of the literature and A number of studies have examined the in public key variant development and security. In general, prior work is limited to a subset of public key increasing complexity but the benefits of speed up encryption/ decryption have not been fully established. So this paper will be the basis for those who want to develop and find proposed solutions for new studies of the NTRU algorithm. This paper aims to develop a framework to investigate the NTRU development, had been discovered that despite its development over the years and even its acceptance in round three of post quantum cryptograph, then found that limit study in the new scope of quantum facility and the ability of hybrid of new study.

DOI
10.11591/ijeecs.v28.i2.pp1164-1173

Related papers

New design of NTRU key using QKD variants

Saba Alaa Abdulwahhab, Qasim Mohammed Hussien, Imad Fakhri Taha Alshaikhli

As life developed, cryptography became crucial.As its utility is not limited to changing the structure of information and making it difficult to interpret (even if it reaches unauthorized individuals), it proves that the information is real from its source and has not been modified during the transmitting or saving process.In this research modifying the NTRU (Number Theory Research Unit) cryptosystem by employing QKD (quantum key distribution) to change the mathematical structure with a physical structure for the public as well as text encryption and decryption.As a result, to obtain higher security to detect EAV and automatically change the key if EAV detects and intercepts the data when the transmutation between ALICE and BOB is quantummechanically approved, the laws of quantum mechanics can be used to make cryptographic protocols that are always safe. METHODIn this section presented the basic algorithms QKD and NTRU which will be used primarily in our scheme, and then attempted to demonstrate in both algorithms, finally displaying and approving a new scheme:

AIP conference proceedings•Jan 1, 2024•2 citations

Improved Decryption Bounds and Key Generation for Matrix NTRU over Integral Domain

Thiago do Rêgo Sousa, Tertuliano Souza Neto

Shor’s algorithm [Shor 1994] is the main threat to classical public-key cryptography. Since its introduction in 1996, NTRU and its variants aim to develop cryptographic algorithms that are secure even against quantum computers. In this work, we study the matrix NTRU over integral domains proposed in 2023. We found that there is an error on the condition to avoid decryption failures and the key generation process is not practical due to severe limitations on matrix inversion. We propose a corrected statement for the decryption failure theorem and an expansion of the set of solutions when dealing with the problem of inverting matrix in Mn(Z[ √ −3]) that makes the key generation significantly faster.

Simpósio Brasileiro de Cibersegurança (SBSeg)•Sep 1, 2025•1 citation

An Investigative Study on Variants of Post-Quantum RSA

Kondapalli V V Subbarao, Manas Kumar Yogi

As quantum computing advances, traditional cryptographic schemes such as RSA face increasing vulnerability to attacks. This investigative study delves into the realm of post-quantum cryptography, focusing specifically on variants of RSA designed to resist quantum attacks. Through a comprehensive review of existing literature and cryptographic protocols, we analyse the strengths and weaknesses of various post-quantum RSA variants, including lattice-based, code-based, and hash-based approaches. Additionally, we evaluate the computational efficiency and security guarantees of these variants, considering factors such as key size, encryption/decryption speed, and resistance to quantum algorithms. Our findings provide insights into the current state of post-quantum RSA, highlighting promising directions for further research and development in the quest for quantum-resistant cryptographic solutions. In the future robust variants of RSA, algorithms will help the stakeholders of the cryptosystems to instil faith in the security of the system in the face of challenges which is inadvertently posed by the attackers using advanced security attack vectors.

Journal of Cryptography and Network Security Design and Codes•Apr 9, 2024•0 citations

A Research on the Application Comparison of NTRU in Typical Fully Homomorphic Encryption Scheme

Xu Zhao, Zheng Yuan

Fully homomorphic encryption (FHE) allows arbitrary computations to be performed directly on encrypted data and is a core technology for privacy computing and secure cloud computing. The Number Theory Research Unit (NTRU) has become a research topic in this field by virtue of its lattice-based anti-quantum security, efficient polynomial operation characteristics and natural multi-key homomorphism capability. In this paper, we systematically review the key advances of NTRU-based FHE, covering the directions of the design of FHE, the optimization of bootstrapping techniques, and the application to FHE for multi-key approaches. Furthermore, the innovativeness and practical application challenges of the schemes are analyzed, and the future research trends are envisioned.

International Symposium on AI and Cybersecurity (ISAICS)•Oct 24, 2025•0 citations

Research of post-quantum public key encryption algorithm

І.Д. Горбенко, О.Г. Качко, Olga Akolzina

In this document NTRU-similar public key encryption algorithm is explored in terms of security, complexity and speed characterictics.

International Conference on Information and Telecommunication Technologies and Radio Electronics (UkrMiCo)•Sep 1, 2018•1 citation

NTRU cryptosystem a solution to the quantum threat

Guiot Cusidó, Miquel, Guitart Morales, Xavier

Most of the current public key cryptosystems’ security is based on the integer factorization and the discrete logarithm, which are mathematical problems that are considered difficult to solve. However, the publication in 1994 of the Shor’s algorithm [1] was a major setback for the world of cryptography, since it provided a quantum algorithm capable of solving efficiently these mathematical problems. Therefore, in recent years many governments and technology companies have put a lot of effort into developing what is known as post-quantum cryptography, i.e. the science that studies cryptosystems that are resistant to quantum attacks. Along these lines, in 2016 the National Institute of Standards & Technology launched a competition with the aim of establishing and standardising the best performing post-quantum cryptosystems, being the NTRU (Nth Degree Truncated polynomial Ring Units) cryptosystem one of the candidates still on the table. The aim of this project is to study the quantum-resistant cryptosystem NTRU, both from a theoretical and practical point of view. Firstly, the mathematical results on which it is based are presented and the existing attacks against it are analyzed. Finally, a practical implementation of the cryptosystem and four of its attack is carried out, from which experimental results are extracted.

•May 1, 2023•0 citations
Number theory research unit (NTRU) become the most important of securi-ty in recent, with its modification of their variant, this paper search of the literature and A number of studies have examined the in public key variant development and security. In general, prior work is limited to a subset of public key increasing complexity but the benefits of speed up encryption/ decryption have not been fully established. So this paper will be the basis for those who want to develop and find proposed solutions for new studies of the NTRU algorithm. This paper aims to develop a framework to investigate the NTRU development, had been discovered that despite its development over the years and even its acceptance in round three of post quantum cryptograph, then found that limit study in the new scope of quantum facility and the ability of hybrid of new study.
As life developed, cryptography became crucial.As its utility is not limited to changing the structure of information and making it difficult to interpret (even if it reaches unauthorized individuals), it proves that the information is real from its source and has not been modified during the transmitting or saving process.In this research modifying the NTRU (Number Theory Research Unit) cryptosystem by employing QKD (quantum key distribution) to change the mathematical structure with a physical structure for the public as well as text encryption and decryption.As a result, to obtain higher security to detect EAV and automatically change the key if EAV detects and intercepts the data when the transmutation between ALICE and BOB is quantummechanically approved, the laws of quantum mechanics can be used to make cryptographic protocols that are always safe. METHODIn this section presented the basic algorithms QKD and NTRU which will be used primarily in our scheme, and then attempted to demonstrate in both algorithms, finally displaying and approving a new scheme:
Shor’s algorithm [Shor 1994] is the main threat to classical public-key cryptography. Since its introduction in 1996, NTRU and its variants aim to develop cryptographic algorithms that are secure even against quantum computers. In this work, we study the matrix NTRU over integral domains proposed in 2023. We found that there is an error on the condition to avoid decryption failures and the key generation process is not practical due to severe limitations on matrix inversion. We propose a corrected statement for the decryption failure theorem and an expansion of the set of solutions when dealing with the problem of inverting matrix in Mn(Z[ √ −3]) that makes the key generation significantly faster.
As quantum computing advances, traditional cryptographic schemes such as RSA face increasing vulnerability to attacks. This investigative study delves into the realm of post-quantum cryptography, focusing specifically on variants of RSA designed to resist quantum attacks. Through a comprehensive review of existing literature and cryptographic protocols, we analyse the strengths and weaknesses of various post-quantum RSA variants, including lattice-based, code-based, and hash-based approaches. Additionally, we evaluate the computational efficiency and security guarantees of these variants, considering factors such as key size, encryption/decryption speed, and resistance to quantum algorithms. Our findings provide insights into the current state of post-quantum RSA, highlighting promising directions for further research and development in the quest for quantum-resistant cryptographic solutions. In the future robust variants of RSA, algorithms will help the stakeholders of the cryptosystems to instil faith in the security of the system in the face of challenges which is inadvertently posed by the attackers using advanced security attack vectors.
Fully homomorphic encryption (FHE) allows arbitrary computations to be performed directly on encrypted data and is a core technology for privacy computing and secure cloud computing. The Number Theory Research Unit (NTRU) has become a research topic in this field by virtue of its lattice-based anti-quantum security, efficient polynomial operation characteristics and natural multi-key homomorphism capability. In this paper, we systematically review the key advances of NTRU-based FHE, covering the directions of the design of FHE, the optimization of bootstrapping techniques, and the application to FHE for multi-key approaches. Furthermore, the innovativeness and practical application challenges of the schemes are analyzed, and the future research trends are envisioned.
Most of the current public key cryptosystems’ security is based on the integer factorization and the discrete logarithm, which are mathematical problems that are considered difficult to solve. However, the publication in 1994 of the Shor’s algorithm [1] was a major setback for the world of cryptography, since it provided a quantum algorithm capable of solving efficiently these mathematical problems. Therefore, in recent years many governments and technology companies have put a lot of effort into developing what is known as post-quantum cryptography, i.e. the science that studies cryptosystems that are resistant to quantum attacks. Along these lines, in 2016 the National Institute of Standards & Technology launched a competition with the aim of establishing and standardising the best performing post-quantum cryptosystems, being the NTRU (Nth Degree Truncated polynomial Ring Units) cryptosystem one of the candidates still on the table. The aim of this project is to study the quantum-resistant cryptosystem NTRU, both from a theoretical and practical point of view. Firstly, the mathematical results on which it is based are presented and the existing attacks against it are analyzed. Finally, a practical implementation of the cryptosystem and four of its attack is carried out, from which experimental results are extracted.