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

International Conference on Information and Telecommunication Technologies and Radio Electronics (UkrMiCo)

Research of post-quantum public key encryption algorithm

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

Published Sep 1, 2018• 1 citation
Publisher

Abstract

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

Related papers

On adapting NTRU for Post-Quantum Public-Key Encryption

Eodardo Signorini, Guglielmo Morgari, Simone Dutto

•Jan 1, 2024•0 citations

An overview of number theory research unit variant development security

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

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.

Indonesian Journal of Electrical Engineering and Computer Science•Sep 21, 2022•2 citations

EagleTru : A new MNTRU/NTRU based KEM Making again Ring and Module based Schemes smaller and faster

Nafi Dione, Diop, Madické, Abiodoun Clement Hounkpevi +4 more

In post-quantum cryptography, recently many interesting works were done to improve the efficiency of Public Key Encryption (PKE) and Key Encapsulation Management (KEM) schemes based on NTRU (ANTS '98) lattices by reducing the size of the ciphertext (ct) and the public key (pk), and also by improving the speed of the associated algorithms: BAT (TCHES, 2022), NTTRU (TCHES, 2019) and it's generalization (called here NTRU-ABC) by Duman et al (PKC, 2023), NEV (ASIACRYPT 2023), NTRU+ (IEEE, 2023), CTRU and CNTR (Science Direct 2023). In Module-Falcon signature paper (ASIA CCS 2020), a public key encryption based on MNTRU was proposed but its efficiency was not better than existing schemes as said by their authors. In this work, we propose EagleTru, a new family of MNTRU and NTRU based PKEs and KEMs. The public key is H = D(pG) -1 mod ± q ∈ R l×l q where gcd(p, q) = 1, G is a square matrix invertible in R l×l q

•May 27, 2025•0 citations

A survey of classical public-key cryptography and post-quantum lattice-based cryptography

Vinay Oedayrajsingh Varma

•Jan 1, 2017•0 citations

Heuristically secure threshold lattice-based cryptography schemes

James D Dalton

In public-key encryption, a long-term private key can be an easy target for hacking and deserves extra protection. One way to enhance its security is to share the long-term private key among multiple (say n) distributed servers; any threshold number (t, t ≤ n) of these servers are needed to collectively use the shared private key without reconstructing it. As a result, an attacker who has compromised less than t servers will still not be able to reconstruct the shared private key. In this thesis, we studied threshold decryption schemes for lattice-based public-key en- cryption, which is one of the most promising post-quantum public-key encryption schemes. We developed threshold decryption schemes for Stinson’s, the standard NTRU, and NTRU with Ring Learning with Errors (R-LWE) cryptosystems. Prototype implementations were developed for validating the functionality of these threshold decryption schemes. Our de- signs achieve heuristic security, and its security is supported by mechanisms similar to that of R-LWE.

•Jan 1, 2021•1 citation

Mathematical Analysis of Public Key Encryption Algorithm and Security of Anti Quantum Cryptography

彪高泽 唐

Advances in Applied Mathematics•Jan 1, 2018•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.
In post-quantum cryptography, recently many interesting works were done to improve the efficiency of Public Key Encryption (PKE) and Key Encapsulation Management (KEM) schemes based on NTRU (ANTS '98) lattices by reducing the size of the ciphertext (ct) and the public key (pk), and also by improving the speed of the associated algorithms: BAT (TCHES, 2022), NTTRU (TCHES, 2019) and it's generalization (called here NTRU-ABC) by Duman et al (PKC, 2023), NEV (ASIACRYPT 2023), NTRU+ (IEEE, 2023), CTRU and CNTR (Science Direct 2023). In Module-Falcon signature paper (ASIA CCS 2020), a public key encryption based on MNTRU was proposed but its efficiency was not better than existing schemes as said by their authors. In this work, we propose EagleTru, a new family of MNTRU and NTRU based PKEs and KEMs. The public key is H = D(pG) -1 mod ± q ∈ R l×l q where gcd(p, q) = 1, G is a square matrix invertible in R l×l q
In public-key encryption, a long-term private key can be an easy target for hacking and deserves extra protection. One way to enhance its security is to share the long-term private key among multiple (say n) distributed servers; any threshold number (t, t ≤ n) of these servers are needed to collectively use the shared private key without reconstructing it. As a result, an attacker who has compromised less than t servers will still not be able to reconstruct the shared private key. In this thesis, we studied threshold decryption schemes for lattice-based public-key en- cryption, which is one of the most promising post-quantum public-key encryption schemes. We developed threshold decryption schemes for Stinson’s, the standard NTRU, and NTRU with Ring Learning with Errors (R-LWE) cryptosystems. Prototype implementations were developed for validating the functionality of these threshold decryption schemes. Our de- signs achieve heuristic security, and its security is supported by mechanisms similar to that of R-LWE.