Melola Discovery

← Melola Discovery

Akses terbuka Jurnal SINTA 3

MODIFICATION OF POLLARD RHO ALGORITHM USING NEGATION MAPPING

BAREKENG: Jurnal Ilmu Matematika dan Terapan · Vol. 16 No. 4 (2022) · hlm. 1159–1166

DOI
10.30598/barekengvol16iss4pp1159-1166
ISSN
2615-3017, 1978-7227
Terbit
2022-12-15
Penerbit
PATTIMURA UNIVERSITY
Bahasa
eng
Lisensi
creativecommons.org/licenses/by-sa/4.0

Abstrak

El Gamal encryption was introduced in 1985 and is still commonly used today. Its hardness is based on a discrete logarithm problem defined over the finite abelian cyclic group group chosen in the original paper was but later it was proven that using the group of Elliptic Curve points could significantly reduce the key size required. The modified El Gamal encryption is dubbed its analog version. This analog encryption bases its hardness on Elliptic Curve Discrete Logarithm Problem (ECDLP). One of the fastest attacks in cracking ECDLP is the Pollard Rho algorithm, with the expected number of iterations where is the number of points in the curve. This paper proposes a modification of the Pollard Rho algorithm using a negation map. The experiment was done in El Gamal analog encryption of elliptic curve defined over the field with different values of small digit. The modification was expected to speed up the algorithm by times. The average of speed up in the experiment was 1.9 times.

Jaringan kolaborasi para penulis

5 penulis · 7 tautan kepenulisan bersama

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

  • Politeknik Siber dan Sandi Negara
  • 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
Rosa RosaPoliteknik Siber dan Sandi Negara1
Nadia Paramita Retno AdiatiPoliteknik Siber dan Sandi Negara1
Sri RosdianaPoliteknik Siber dan Sandi Negara1

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">MODIFICATION OF POLLARD RHO ALGORITHM USING NEGATION MAPPING</dc:title>
	<dc:creator>Carita, Sa'aadah Sajjana</dc:creator>
	<dc:creator>Kabetta, Herman</dc:creator>
	<dc:description xml:lang="en-US">El Gamal encryption was introduced in 1985 and is still commonly used today. Its hardness is based on a discrete logarithm problem defined over the finite abelian cyclic group group chosen in the original paper was  but later it was proven that using the group of Elliptic Curve points could significantly reduce the key size required. The modified El Gamal encryption is dubbed its analog version. This analog encryption bases its hardness on Elliptic Curve Discrete Logarithm Problem (ECDLP). One of the fastest attacks in cracking ECDLP is the Pollard Rho algorithm, with the expected number of iterations  where  is the number of points in the curve. This paper proposes a modification of the Pollard Rho algorithm using a negation map. The experiment was done in El Gamal analog encryption of elliptic curve defined over the field  &amp;nbsp;with different values of small digit  . The modification was expected to speed up the algorithm by  &amp;nbsp;times. The average of speed up in the experiment was 1.9 times.</dc:description>
	<dc:publisher xml:lang="en-US">PATTIMURA UNIVERSITY</dc:publisher>
	<dc:date>2022-12-15</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/5723</dc:identifier>
	<dc:identifier>10.30598/barekengvol16iss4pp1159-1166</dc:identifier>
	<dc:source xml:lang="en-US">BAREKENG: Jurnal Ilmu Matematika dan Terapan; Vol 16 No 4 (2022): BAREKENG: Journal of Mathematics and Its Applications; 1159-1166</dc:source>
	<dc:source>2615-3017</dc:source>
	<dc:source>1978-7227</dc:source>
	<dc:source>10.30598/barekengvol16iss4year2022</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ojs3.unpatti.ac.id/index.php/barekeng/article/view/5723/5132</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2022 Sa'aadah Sajjana Carita, Herman Kabetta</dc:rights>
	<dc:rights xml:lang="en-US">http://creativecommons.org/licenses/by-sa/4.0</dc:rights>
</oai_dc:dc>