On the correct use of the negation map in the Pollard rho method

No abstract is available for this paper.

• Publication year

  2011

• Venue

  IACR Cryptology ePrint Archive

• Publication date

  2011-03-06

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/978-3-642-19379-8_8
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Parallel Collision Search with Cryptanalytic Applications

  2013cited by this paper
• Cell Broadband Engine Architecture

  2011cited by this paper
• Monte Carlo Methods for Index Computation (mod p)

  2010cited by this paper
• On the Use of the Negation Map in the Pollard Rho Method

  2010cited by this paper
• Progress in Cryptology - AFRICACRYPT 2009, Second International Conference on Cryptology in Africa, Gammarth, Tunisia, June 21-25, 2009. Proceedings

  2009cited by this paper
• Breaking ECC2K-130

  2009cited by this paper
• On the Security of 1024-bit RSA and 160-bit Elliptic Curve Cryptography

  2009cited by this paper
• Fast Elliptic-Curve Cryptography on the Cell Broadband Engine

  2009cited by this paper
• Curve25519: New Diffie-Hellman Speed Records

  2006cited by this paper
• Public Key Cryptography - PKC 2006: 9th International Conference on Theory and Practice in Public-Key Cryptography, New York, NY, USA, April 24-26, 2006. ... (Lecture Notes in Computer Science)

  2006cited by this paper
• Selected Areas in Cryptography

  2005cited by this paper
• On random walks for Pollard's rho method

  2001cited by this paper
• Improving the parallelized Pollard lambda search on anomalous binary curves

  2000cited by this paper
• Speeding up the Discrete Log Computation on Curves with Automorphisms

  1999cited by this paper
• Factorization of RSA-140 Using the Number Field Sieve

  1999cited by this paper
• Faster Attacks on Elliptic Curve Cryptosystems

  1998cited by this paper
• Speeding the Pollard and elliptic curve methods of factorization

  1987cited by this paper
• Monte Carlo methods for index computation ()

  1978cited by this paper

• Privacy-Preserving Learning Model Using Lightweight Encryption for Visual Sensing Industrial IoT Devices

  2025cites this paper
• Asymptotics for the standard block size in primal lattice attacks: second order, formally verified

  2024cites this paper
• An algorithm to select a secure twisted elliptic curve in cryptography

  2022cites this paper
• Higher-degree supersingular group actions

  2021cites this paper
• Time-Memory Analysis of Parallel Collision Search Algorithms

  2021cites this paper
• Curves with fast computations in the first pairing group

  2020cites this paper
• CRYPTREC Review of EdDSA

  2020cites this paper
• TMVP-Friendly Primes for Efficient Elliptic Curve Cryptography

  2020cites this paper
• A Survey of Fast Scalar Multiplication on Elliptic Curve Cryptography for Lightweight Embedded Devices

  2019cites this paper
• The complete cost of cofactor h=1

  2019cites this paper
• Halo: Recursive Proof Composition without a Trusted Setup

  2019cites this paper
• A tale of SNARKs: quantum resilience, knowledge extractability and data privacy. (Un recueil de SNARKs: sécurité quantique, extractabilité et confidentialité des données)

  2019cites this paper
• Efficient many-core architecture design for cryptanalytic collision search on FPGAs

  2018cites this paper
• Time-Memory Trade-offs for Parallel Collision Search Algorithms

  2018cites this paper
• A Study on the Parameter Size of the Montgomery Trick for ECDLP

  2018cites this paper
• Pre- and post-quantum Diffie-Hellman from groups, actions, and isogenies

  2018cites this paper
• Computing elliptic curve discrete logarithms with improved baby-step giant-step algorithm

  2017cites this paper
• Accelerated precomputation points–based scalar reduction on elliptic curve cryptography for wireless sensor networks

  2017cites this paper
• Zero-knowledge proofs for secure computation

  2017cites this paper
• Parallel Collision Search with Radix Trees

  2017influential citation
• Bounds in Various Generalized Settings of the Discrete Logarithm Problem

  2017cites this paper
• A key agreement authentication protocol using an improved parallel Pollard rho for electronic payment system

  2017cites this paper
• Circuit-extension handshakes for Tor achieving forward secrecy in a quantum world

  2016cites this paper
• Faster elliptic-curve discrete logarithms on FPGAs

  2016cites this paper
• Faster discrete logarithms on FPGAs

  2016influential citation
• Computational hardness of IFP and ECDLP

  2016cites this paper
• MapReduce for Elliptic Curve Discrete Logarithm Problem

  2016cites this paper
• Le logarithme discret dans les corps finis

  2016cites this paper
• Harder, better, faster, stronger: elliptic curve discrete logarithm computations on FPGAs

  2015cites this paper
• An efficient many-core architecture for Elliptic Curve Cryptography security assessment

  2015cites this paper
• Solving prime-field ECDLPs on GPUs with OpenCL

  2015influential citation
• On the Heuristic of Approximating Polynomials over Finite Fields by Random Mappings

  2015cites this paper
• Recent progress on the elliptic curve discrete logarithm problem

  2015cites this paper
• On the Analysis of Public-Key Cryptologic Algorithms

  2015influential citation
• Breaking ecc2-113: Efficient Implementation of an Optimized Attack on a Reconfigurable Hardware Cluster

  2014cites this paper
• Elliptic and Hyperelliptic Curves: A Practical Security Analysis

  2014influential citation
• The Past, evolving Present and Future of Discrete Logarithm

  2014cites this paper
• Faster Compact Diffie-Hellman: Endomorphisms on the x-line

  2014cites this paper
• Kangaroos in Side-Channel Attacks

  2014cites this paper
• Index calculus in the trace zero variety

  2014cites this paper
• A new iterating function in the Pollard rho method for discrete logarithms

  2014cites this paper
• Project report – General Attacks on Elliptic Curve Based Cryptosystems

  2013cites this paper
• ANTS X Proceedings of the Tenth Algorithmic Number Theory Symposium msp Two grumpy giants and a baby

  2013cites this paper
• Computing elliptic curve discrete logarithms with the negation map

  2012cites this paper
• A Hardware-Accelerated ECDLP with High-Performance Modular Multiplication

  2012influential citation
• Mathematics of Public Key Cryptography

  2012cites this paper
• On the Strength Comparison of the ECDLP and the IFP

  2012cites this paper
• Implementation of SCA-Resistant CPU and an ECDLP Engine on FPGA Platform

  2012influential citation
• Solving Discrete Logarithms in Smooth-Order Groups with CUDA 1

  2012cites this paper
• Design Methods for Cryptanalysis

  2012influential citation
• A Flexible Hardware ECDLP Engine in Bluespec

  2012influential citation
• Solving a 112-bit prime elliptic curve discrete logarithm problem on game consoles using sloppy reduction

  2012cites this paper
• On the Use of the Negation Map in Pollard-Rho Method CS 259 C-Elliptic Curves in Cryptography Final paper Fall

  2012cites this paper
• An Integrated Prime-Field ECDLP Hardware Accelerator with High-Performance Modular Arithmetic Units

  2011influential citation
• Speeding up elliptic curve discrete logarithm computations with point halving

  2011cites this paper
• Discrete Logarithms

  2009cites this paper
• Pre-and post-quantum Diffie-Hellman from groups, actions, and isogenies

  year unknowncites this paper
• Faster Compact Diffie-Hellman: Endomorphisms on the x-line

  year unknowncites this paper
• Pre-and post-quantum Diffie–Hellman from groups, actions, and isogenies

  year unknowncites this paper