A Provably Secure Variant of ETRU Based on Extended Ideal Lattices Over Direct Product of Dedekind Domains

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

EBRAHIMI ATANI REZA; EBRAHIMI ATANI SHAHABADDIN; HASSANI KARBASI AMIR

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: JOURNAL OF COMPUTING AND SECURITY Year:2018 | Volume:5 | Issue:1 Page(s): 13-34

Download Full-Text

View:

158

Download:

Cites:

Information Journal Paper

Title

A Provably Secure Variant of ETRU Based on Extended Ideal Lattices Over Direct Product of Dedekind Domains

Author(s)

EBRAHIMI ATANI REZA | EBRAHIMI ATANI SHAHABADDIN | HASSANI KARBASI AMIR | Issue Writer Certificate

Keywords

Lattice-Based Cryptography

ETRU

Ideal Lattices

Dedekind Domains

Provable Security

Abstract

Jarvis and Nevins presented ETRU in 2013 which has applausive performance with moderate key-sizes and conjectured resistance to quantum computers. ETRU, as an e cient NTRUEncrypt-like cryptosystem, is over the ring of Eisenstein integers that is faster with smaller keys for the same or better level of security than does NTRUEncrypt which is a desirable alternative to public-key cryptosystems based on factorisation and discrete logarithm problem. However, because of its construction, doubts have regularly arisen on its security. In this paper, we propose how to modify ETRU to make it provably secure, under our modi ed assumption of quantum hardness of standard worst-case lattice problems, restricted to extended ideal lattices related to some extensions of cyclotomic elds structures. We describe the structure of all generated polynomial rings of quotient over direct product of Dedekind domains Z and Z[ 3], where 3 is complex cube root of unity. We give a detailed description to show that if the private key polynomials of the ETRU are selected from direct product of some Dedekind domains using discrete Gaussians, then the public key, which is their ratio, is statistically indistinguishable from uniform over its range. The security then proves for our main system from the already proven hardness of the R-SIS and R-LWE problems by their extensions.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

APA: Copy

EBRAHIMI ATANI, REZA, EBRAHIMI ATANI, SHAHABADDIN, & HASSANI KARBASI, AMIR. (2018). A Provably Secure Variant of ETRU Based on Extended Ideal Lattices Over Direct Product of Dedekind Domains. JOURNAL OF COMPUTING AND SECURITY, 5(1), 13-34. SID. https://sid.ir/paper/341717/en

Vancouver: Copy

EBRAHIMI ATANI REZA, EBRAHIMI ATANI SHAHABADDIN, HASSANI KARBASI AMIR. A Provably Secure Variant of ETRU Based on Extended Ideal Lattices Over Direct Product of Dedekind Domains. JOURNAL OF COMPUTING AND SECURITY[Internet]. 2018;5(1):13-34. Available from: https://sid.ir/paper/341717/en

IEEE: Copy

REZA EBRAHIMI ATANI, SHAHABADDIN EBRAHIMI ATANI, and AMIR HASSANI KARBASI, “A Provably Secure Variant of ETRU Based on Extended Ideal Lattices Over Direct Product of Dedekind Domains,” JOURNAL OF COMPUTING AND SECURITY, vol. 5, no. 1, pp. 13–34, 2018, [Online]. Available: https://sid.ir/paper/341717/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops