Computing elliptic curve discrete logarithms with the negation map

DOI10.1016/J.INS.2012.01.044MaRDI QIDQ454851zbMATH OpenOpenAlexFDO

Authors 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

elliptic curve discrete logarithmfruitless cyclenegation mapPollard rho methodrandom walk

Mathematics Subject Classification ID

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

Recommendations

• On the use of the negation map in the Pollard rho method
• Computing elliptic curve discrete logarithms with improved baby-step giant-step algorithm
• On the correct use of the negation map in the Pollard rho method
• Speeding up elliptic curve discrete logarithm computations with point halving
• Improving ECDLP computation in characteristic 2

Cites work

• A public key cryptosystem and a signature scheme based on discrete logarithms
• An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
• Certificateless threshold signature scheme from bilinear maps
• Efficient signature generation by smart cards
• Elliptic Curve Cryptosystems
• Group-oriented fair exchange of signatures
• scientific article; zbMATH DE number 435565 (Why is no real title available?)
• scientific article; zbMATH DE number 3948147 (Why is no real title available?)
• scientific article; zbMATH DE number 1186971 (Why is no real title available?)
• scientific article; zbMATH DE number 1304118 (Why is no real title available?)
• scientific article; zbMATH DE number 1504543 (Why is no real title available?)
• scientific article; zbMATH DE number 954401 (Why is no real title available?)
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• Improving the parallelized Pollard lambda search on anomalous binary curves
• Monte Carlo Methods for Index Computation (mod p)
• On random walks for Pollard's rho method
• On the correct use of the negation map in the Pollard rho method
• On the use of the negation map in the Pollard rho method
• Parallel collision search with cryptanalytic applications
• Probability Distributions Related to Random Mappings

Cited in

(5)

• 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
• On the correct use of the negation map in the Pollard rho method
• On the use of the negation map in the Pollard rho method

This page was built for publication: Computing elliptic curve discrete logarithms with the negation map

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q454851)