Melola Discovery

← Melola Discovery

Akses terbuka Jurnal SINTA 3

ALGEBRAIC CRYPTANALYSIS ON NTRU-HPS AND NTRU-HRSS

BAREKENG: Jurnal Ilmu Matematika dan Terapan · Vol. 17 No. 4 (2023) · hlm. 2187–2196

DOI
10.30598/barekengvol17iss4pp2187-2196
ISSN
2615-3017, 1978-7227
Terbit
2023-12-19
Penerbit
PATTIMURA UNIVERSITY
Bahasa
eng
Lisensi
creativecommons.org/licenses/by-sa/4.0

Abstrak

NTRU is a lattice-based public-key cryptosystem designed by Hoffstein, Pipher, and Silverman in 1996. NTRU published on Algorithmic Number Theory Symposium (ANTS) in 1998. The ANTS’98 NTRU became the IEEE standard for public key cryptographic techniques based on hard problems over lattices in 2008. NTRU was later redeveloped by NTRU Inc. in 2018 and became one of the finalists in round 3 of the PQC (Post-Quantum Cryptography) standardization process organized by NIST in 2020. There are two types of NTRU algorithms proposed by NTRU Inc., which are classified based on parameter determination, NTRU-HPS (Hoffstein, Pipher, Silverman) and NTRU-HRSS (Hulsing, Rijnveld, Schanck, Schwabe). Algebraic cryptanalysis on ANTS’98 NTRU had previously been carried out in 2009 and 2012. In this paper, algebraic cryptanalysis is performed on NTRU-HPS with q=2048, n=509 (ntruhps2048509) and NTRU-HRSS with n=701 (ntruhrss701). This research aims to evaluate the resistance of NTRU-HPS and NTRU-HRSS algorithms against algebraic cryptanalysis by reconstructing the private key value. As a result, NTRU-HPS and NTRU-HRSS resistance to algebraic cryptanalysis.

Jaringan kolaborasi para penulis

8 penulis · 13 tautan kepenulisan bersama · 1 lintas organisasi

Arahkan kursor atau ketuk sebuah nama untuk menyorot rekan penulisnya. Klik dua kali untuk membuka halaman penulis.

  • University of Indonesia
  • Syarif Hidayatullah State Islamic University Jakarta
  • Afiliasi tidak diketahui
  • Organisasi berbeda
  • Organisasi sama
  • Afiliasi tidak diketahui
  • Garis lebih tebal = lebih banyak artikel bersama · lingkaran lebih besar = lebih banyak artikel
Tampilkan sebagai tabel
Rekan penulisOrganisasiArtikel bersama
Wahri IrawanSyarif Hidayatullah State Islamic University Jakarta1
Muhammad Irfan Arsyad PrayitnoUniversity of Indonesia1
Fawwaz Chirag; Combinatorics and Algebra Research Group, Department of Mathematics, Faculty of Mathematics and Natural Sciences, Universitas Indonesia, Indonesia SofyanAfiliasi tidak diketahui1
Syafrizal; Department of Mathematics and Data Science, Faculty of Mathematics and Natural Sciences, Andalas University, Padang, Indonesia SyAfiliasi tidak diketahui1
Nurdin; Graph Theory Research Group, Department of Mathematics, Faculty of Mathematics and Natural Sciences, Hasanuddin University, Indonesia HindingAfiliasi tidak diketahui1
Rinovia; Combinatorial Mathematics Research Group, Faculty of Mathematics and Natural Sciences, Institut Teknologi Bandung, Indonesia SimanjuntakAfiliasi tidak diketahui1

Afiliasi berasal dari OpenAlex; metadata OAI-PMH jurnal tidak memuatnya. Penulis tanpa ID OpenAlex dicocokkan berdasarkan nama, sehingga dua orang bisa tergabung atau satu orang bisa terpisah.

Sumber metadata: OAI-PMH (metadata jurnal) https://ojs3.unpatti.ac.id/index.php/barekeng/oai, pertama di-harvest 5 Nov 2026, terakhir terlihat 15 Nov 2026.
Metadata asli (oai_dc)
<oai_dc:dc xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/  http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">ALGEBRAIC CRYPTANALYSIS ON NTRU-HPS AND NTRU-HRSS</dc:title>
	<dc:creator>Paradise, Fadila</dc:creator>
	<dc:creator>Sugeng, Kiki Ariyanti</dc:creator>
	<dc:description xml:lang="en-US">NTRU is a lattice-based public-key cryptosystem designed by Hoffstein, Pipher, and Silverman in 1996. NTRU published on Algorithmic Number Theory Symposium (ANTS) in 1998. The ANTS’98 NTRU became the IEEE standard for public key cryptographic techniques based on hard problems over lattices in 2008. NTRU was later redeveloped by NTRU Inc. in 2018 and became one of the finalists in round 3 of the PQC (Post-Quantum Cryptography) standardization process organized by NIST in 2020. There are two types of NTRU algorithms proposed by NTRU Inc., which are classified based on parameter determination, NTRU-HPS (Hoffstein, Pipher, Silverman) and NTRU-HRSS (Hulsing, Rijnveld, Schanck, Schwabe). Algebraic cryptanalysis on ANTS’98 NTRU had previously been carried out in 2009 and 2012. In this paper, algebraic cryptanalysis is performed on NTRU-HPS with q=2048, n=509 (ntruhps2048509) and NTRU-HRSS with n=701 (ntruhrss701). This research aims to evaluate the resistance of NTRU-HPS and NTRU-HRSS algorithms against algebraic cryptanalysis by reconstructing the private key value. As a result, NTRU-HPS and NTRU-HRSS resistance to algebraic cryptanalysis.</dc:description>
	<dc:publisher xml:lang="en-US">PATTIMURA UNIVERSITY</dc:publisher>
	<dc:date>2023-12-19</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ojs3.unpatti.ac.id/index.php/barekeng/article/view/9788</dc:identifier>
	<dc:identifier>10.30598/barekengvol17iss4pp2187-2196</dc:identifier>
	<dc:source xml:lang="en-US">BAREKENG: Jurnal Ilmu Matematika dan Terapan; Vol 17 No 4 (2023): BAREKENG: Journal of Mathematics and Its Applications; 2187-2196</dc:source>
	<dc:source>2615-3017</dc:source>
	<dc:source>1978-7227</dc:source>
	<dc:source>10.30598/barekengvol17iss4year2023</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ojs3.unpatti.ac.id/index.php/barekeng/article/view/9788/7202</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2023 Fadila Paradise, Kiki Ariyanti Sugeng</dc:rights>
	<dc:rights xml:lang="en-US">http://creativecommons.org/licenses/by-sa/4.0</dc:rights>
</oai_dc:dc>