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
- ISSN
- 2615-3017, 1978-7227
- Terbit
- 2022-12-15
- Penerbit
- PATTIMURA UNIVERSITY
- Bahasa
- eng
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 penulis | Organisasi | Artikel bersama |
|---|---|---|
| Rosa Rosa | Politeknik Siber dan Sandi Negara | 1 |
| Nadia Paramita Retno Adiati | Politeknik Siber dan Sandi Negara | 1 |
| Sri Rosdiana | Politeknik Siber dan Sandi Negara | 1 |
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.