NTRU inverse polynomial algorithm based on the LU decomposition method of matrix inversion

Gaithuru, Juliet Nyokabi; Salleh, Mazleena; Mohamad, Ismail

doi:10.1109/ains.2017.8270415

Cited by 6 publications

(1 citation statement)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…NTRU operations are based on objects in the 𝑅 = 𝑍[𝑋] 𝑋 𝑁 −1 truncated polynomial ring As a consequence [12], NTRU may achieve high speeds while using little computing resources [13]. The NTRU key generation technique requires computing the modular multiplicative inverse of F modulo p and q [14], making it the first secure public-key cryptosystem that does not depend on factorization or discrete logarithm concerns [15]. Let f, g polynomial of the form:…”

Section: Research Methods Of Ntrumentioning

confidence: 99%

An overview of number theory research unit variant development security

Abdulwahhab

Hussein

Alshaikhli³

2022

IJEECS

View full text Add to dashboard Cite

Number <span>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</span>.

show abstract