ETRU: NTRU over the Eisenstein integers

Jarvis, Katherine; Nevins, Monica

doi:10.1007/s10623-013-9850-3

Cited by 36 publications

(49 citation statements)

References 18 publications

(42 reference statements)

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The security of NTRU is based on the difficulty in solving certain lattice problems, namely: the approximate Closest Vector Problem (appr-CVP) and the Shortest Vector Problem (SVP) in convolution modular lattices. The lattice structure in NTRU is not vulnerable to quantum computing algorithms thus is described as being a quantum-resistant cryptosystem [5], [16], [17].…”

Section: Ntru Cryptosystemmentioning

confidence: 99%

“…It has been implemented in commercial applications as well as open source models [16]. Due to its high speed and low memory, it has been implemented in mobile devices and smart cards.…”

Section: Ntru Cryptosystemmentioning

confidence: 99%

“…Finally, NTRU has a very small footprint which is about 8kb of compiled code, which makes it appropriate for implementation in devices with limited memory and processing power such as mobile devices and embedded devices [16].…”

Section: Strengths Of Ntrumentioning

confidence: 99%

“…One major weakness of NTRU is that there is the possibility of the occurrence of a decryption failure from a validly created ciphertext. Some measures have been proposed to reduce this possibility, some of which are a careful selection of parameters such that q is as small as possible [16], adding some check bits to the message block [14], the use of a centering scheme and using a protocol which checks for errors and re-encrypts [29], [30].…”

Section: Weaknesses Of Ntrumentioning

confidence: 99%

See 3 more Smart Citations

Insight into the operation of NTRU and a comparative study of NTRU, RSA and ECC public key cryptosystems

Gaithuru

Bakhtiari

2014

2014 8th. Malaysian Software Engineering Conference (MySEC)

View full text Add to dashboard Cite

Information is a fundamental part of the world today and with it has come the need for information security during communication over public channels so as to safeguard communication. There are various public key algorithms being implemented today, the most popular being RSA and ECC. Given the trend towards quantum computing systems, there is need to provide assurance of information security in the postquantum period. Due to the susceptibility of ECC and RSA to quantum algorithm attacks, NTRU is the leading alternative. This paper provides a clear description of the operation of the NTRU public key cryptosystem, the constraints for the selection of its parameters, its security followed by a practical illustration of its operation. This paper also highlights the strengths and weaknesses of NTRU followed by a comparative study of the performance of NTRU, RSA and ECC. Finally, we give a conclusion of potential areas for further research so as to provide assurance of security pertaining to NTRU.

show abstract

Section: Ntru Cryptosystemmentioning

confidence: 99%

“…It has been implemented in commercial applications as well as open source models [16]. Due to its high speed and low memory, it has been implemented in mobile devices and smart cards.…”

Section: Ntru Cryptosystemmentioning

confidence: 99%

Section: Strengths Of Ntrumentioning

confidence: 99%

Section: Weaknesses Of Ntrumentioning

confidence: 99%

See 2 more Smart Citations

Insight into the operation of NTRU and a comparative study of NTRU, RSA and ECC public key cryptosystems

Gaithuru

Bakhtiari

2014

2014 8th. Malaysian Software Engineering Conference (MySEC)

View full text Add to dashboard Cite

show abstract

“…In 2013, Jarvis et al [16] proposed a new framework based on the ring of a cubic root of unity known as the Eisenstein ring , whose coefficient integers belong to . They called it ETRU.…”

Section: Introductionmentioning

confidence: 99%

BITRU: Binary Version of the NTRU Public Key Cryptosystem via Binary Algebra

Al-Saidi¹,

Yassein²

2016

ijacsa

View full text Add to dashboard Cite

Abstract-New terms such as closest vector problem (CVP) and the shortest vector problem (SVP), which have been illustrated as NP-hard problem, emerged, leading to a new hope for designing public key cryptosystem based on certain lattice hardness. A new cryptosystem called NTRU is proven computationally efficient and it can be implemented with low cost. With these characteristics, NTRU possesses advantage over others system that rely on number-theoretical problem in a finite field (e.g. integer factorization problem or discrete logarithm problem). These advantages make NTRU a good choice for many applications. After the adaptation of NTRU, many attempts to generalize its algebraic structure have appeared. In this study, a new variant of the NTRU public key cryptosystem called BITRU is proposed. BITRU is based on a new algebraic structure used as an alternative to NTRU-mathematical structure called binary algebra. This commutative and associative. Establishing two public keys in the proposed system has distinguished it from NTRU and those similar to NTRU cryptosystems. This new structure helps to increase the security and complexity of BITRU. The clauses of BITRU, which include key generation, encryption, decryption, and decryption failure, are explained in details. Its suitability of the proposed system is proven and its security is demonstrated by comparing it with NTRU.

show abstract