Computing elliptic curve discrete logarithms with the negation map

DOI10.1016/j.ins.2012.01.044zbMath1276.94019OpenAlexW1976111498MaRDI QIDQ454851

Fangguo Zhang, Ping Wang

Publication date: 10 October 2012

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2012.01.044

zbMATH Keywords

random walkPollard rho methodelliptic curve discrete logarithmfruitless cyclenegation map

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16)

Related Items

Bootstrapping for approximate homomorphic encryption ⋮ On the multi-user security of short Schnorr signatures with preprocessing ⋮ Computing elliptic curve discrete logarithms with improved baby-step giant-step algorithm

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Group-oriented fair exchange of signatures
• Certificateless threshold signature scheme from bilinear maps
• Efficient signature generation by smart cards
• Parallel collision search with cryptanalytic applications
• On random walks for Pollard's rho method
• On the Correct Use of the Negation Map in the Pollard rho Method
• A public key cryptosystem and a signature scheme based on discrete logarithms
• Elliptic Curve Cryptosystems
• An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
• Monte Carlo Methods for Index Computation (mod p)
• Improving the parallelized Pollard lambda search on anomalous binary curves
• On the Use of the Negation Map in the Pollard Rho Method
• Probability Distributions Related to Random Mappings