MODIFICATION OF POLLARD RHO ALGORITHM USING NEGATION MAPPING
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 signific...
Saved in:
| Main Authors: | Sa'aadah Sajjana Carita, Herman Kabetta |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Universitas Pattimura
2022-12-01
|
| Series: | Barekeng |
| Subjects: | |
| Online Access: | https://ojs3.unpatti.ac.id/index.php/barekeng/article/view/5723 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Analyzing cryptographic algorithm efficiency with in graph-based encryption models
by: Yashmin Banu, et al.
Published: (2025-07-01) -
Elliptic curve ElGamal encryption based location privacy-preserving scheme
by: Huibin LAI, et al.
Published: (2020-06-01) -
The SPN Network for Digital Audio Data Based on Elliptic Curve Over a Finite Field
by: Ijaz Khalid, et al.
Published: (2022-01-01) -
Phase-Image-Encryption-Based Elliptic Curve and Double-Random-Phase Encoding
by: Arabind Kumar, et al.
Published: (2024-01-01) -
Cryptanalysis and improvement of an encryption scheme that uses elliptic curves over finite fields
by: Malik Zia, et al.
Published: (2021-12-01)