An Efficient Collision Detection Method for Computing Discrete Logarithms with Pollard's Rho
Pollard's rho method and its parallelized variant are at present known as the best generic algorithms for computing discrete logarithms. However, when we compute discrete logarithms in cyclic groups of large orders using Pollard's rho method, collision detection is always a high time and s...
Saved in:
| Main Authors: | Ping Wang, Fangguo Zhang |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2012-01-01
|
| Series: | Journal of Applied Mathematics |
| Online Access: | http://dx.doi.org/10.1155/2012/635909 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
MODIFICATION OF POLLARD RHO ALGORITHM USING NEGATION MAPPING
by: Sa'aadah Sajjana Carita, et al.
Published: (2022-12-01) -
Logarithm of the Discrete Fourier Transform
by: Michael Aristidou, et al.
Published: (2007-01-01) -
EFFECT OF PLANTING SPACES AND POLLARDING NUMBER ON ROOTING GROWTH DEVELOPMENT IN LEUCAENA STAND
by: Y. M. Q. Al-Alousy, et al.
Published: (2013-04-01) -
Computational analysis of Rho GTPase cycling.
by: Cibele Vieira Falkenberg, et al.
Published: (2013-01-01) -
EFFECT OF POLLARDING TREATMENT ON SOME GROWTH CHARACTERS OF Robinia pseudoacacia SEEDLING AND BIOMASS PRODUCTION
by: Jyad Abid Al-Ashoo
Published: (2007-03-01)