An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)

Cited in

(only showing first 100 items - show all)

On random walks for Pollard's rho method
A traceable group signature scheme.
Post-quantum static-static key agreement using multiple protocol instances
Complexity of a determinate algorithm for the discrete logarithm
Speeding Up the Pollard Rho Method on Prime Fields
Performance analysis of index calculus method
A deterministic version of Pollard's \(p-1\) algorithm
Elliptic curve cryptography: the serpentine course of a paradigm shift
Accelerating Pollard's rho algorithm on finite fields
Discrete logarithm based additively homomorphic encryption and secure data aggregation
On index calculus algorithms for subfield curves
ID-based threshold digital signature schemes on the elliptic curve discrete logarithm problem
Constructing hyperelliptic curves of genus 2 suitable for cryptography
Efficient Algorithms for Supersingular Isogeny Diffie-Hellman
Computing Logarithms in Finite Fields of Characteristic Two
Low complexity normal bases for \(F_{2^{mn}}\)
Low complexity normal bases
Using partial smoothness of \(p-1\) for factoring polynomials modulo \(p\)
A practical anonymous multi-authority e-cash scheme.
Diffie-Hellman Oracles
Prime Numbers with a Fixed Number of One Bits or Zero Bits in Their Binary Representation
Analysis of the fault attack ECDLP over prime field
One-way permutations on elliptic curves
An efficient collision detection method for computing discrete logarithms with Pollard's rho
Isogenies and the discrete logarithm problem in Jacobians of genus 3 hyperelliptic curves
Collisions in fast generation of ideal classes and points on hyperelliptic and elliptic curves
General secret sharing based on the Chinese remainder theorem with applications in e-voting
Collapse of the hierarchy of constant-depth exact quantum circuits
Improved Pollard rho method for computing discrete logarithms over finite extension fields
Discrete logarithm problem using index calculus method
Several security schemes constructed using ECC-based self-certified public key cryptosystems
Elliptic curve discrete logarithm problem over small degree extension fields
Analysis and design of a secure key exchange scheme
Analysis of the GHS Weil Descent Attack on the ECDLP over Characteristic Two Finite Fields of Composite Degree
Parallel use of multiplicative congruential random number generators
Sequence acquisition using bit estimation techniques
Bug Attacks
Point counting on Picard curves in large characteristic
Constant-round perfect zero-knowledge computationally convincing protocols
Smoothness and factoring polynomials over finite fields
Deterministic root finding over finite fields using Graeffe transforms
Higher \(K\)-groups of smooth projective curves over finite fields
Trading GRH for algebra: algorithms for factoring polynomials and related structures
Another look at HMQV
An Identity-Based Key Agreement Protocol for the Network Layer
Unmediated communication in repeated games with imperfect monitoring.
Privacy preserving OLAP over distributed XML data: A theoretically-sound secure-multiparty-computation approach
A double large prime variation for small genus hyperelliptic index calculus
A key distribution system equivalent to factoring
Construction of CM Picard curves
Critical remarks on some public-key cryptosystems
Fast generators for the Diffie-Hellman key agreement protocol and malicious standards
Bounded tamper resilience: how to go beyond the algebraic barrier
Cryptographic aspects of real hyperelliptic curves
Bug attacks
The \(\mathbb Q\)-curve construction for endomorphism-accelerated elliptic curves
A traceable proxy multisignature scheme based on the elliptic curve cryptosystem
Taking roots over high extensions of finite fields
A taxonomy of pairing-friendly elliptic curves
The Elliptic Curve Discrete Logarithm Problem and Equivalent Hard Problems for Elliptic Divisibility Sequences
The discrete logarithm problem
A discrete logarithm implementation of perfect zero-knowledge blobs
Solving systems of diagonal polynomial equations over finite fields
Effective compression maps for torus-based cryptography
Fault-based attack on Montgomery's ladder algorithm
Computing elliptic curve discrete logarithms with the negation map
Structure computation and discrete logarithms in finite abelian \(p\)-groups
MiMC: efficient encryption and cryptographic hashing with minimal multiplicative complexity
Cryptology: The mathematics of secure communication
Expander graphs based on GRH with an application to elliptic curve cryptography
Computing discrete logarithms in an interval
On relationship of computational Diffie-Hellman problem and computational square-root exponent problem
A novel ID-based group signature
Evaluation of discrete logarithms in a group of 𝑝-torsion points of an elliptic curve in characteristic 𝑝
Univariate polynomial factorization over finite fields
On the deterministic complexity of factoring polynomials
Generating Genus Two Hyperelliptic Curves over Large Characteristic Finite Fields
Über die mathematischen Grundlagen einiger Chiffrierverfahren
Standard generators of finite fields and their cyclic subgroups
Privacy-preserving distributed mining of association rules using elliptic-curve cryptosystem and Shamir's secret sharing scheme
A note on Girault's self-certified model
A serial version of the Pohlig-Hellman algorithm for computing discrete logarithms
Analysis of the Herlestam and Johannesson discrete logarithm scheme in \(GF(2^ N)\) for large N
Efficient cryptosystems from \(2^k\)-th power residue symbols
Efficient Finite Fields in the Maxima Computer Algebra System
An authentication-combined access control scheme using a one-way function
Controlling access in tree hierarchies
Ramanujan's class invariants and their use in elliptic curve cryptography
A fast parallel sparse polynomial GCD algorithm
A low-memory algorithm for point counting on Picard curves
Algorithms for black-box fields and their application to cryptography
Solving systems of linear equations arising in the computation of logarithms in a finite prime field
Scalable zero knowledge via cycles of elliptic curves
Towards isogeny-based password-authenticated key establishment
A key-exchange system based on imaginary quadratic fields
Fast generation of prime numbers and secure public-key cryptographic parameters.
Factor base discrete logarithms in Kummer extensions
Subgroup security in pairing-based cryptography
Survey on SAP and its application in public-key cryptography
Orienting supersingular isogeny graphs

This page was built for publication: An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)

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