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)

Low complexity normal bases for \(F_{2^{mn}}\)
Low complexity normal bases
Performance analysis of index calculus method
Constructing hyperelliptic curves of genus 2 suitable for cryptography
A double large prime variation for small genus hyperelliptic index calculus
Effective compression maps for torus-based cryptography
On index calculus algorithms for subfield curves
Taking roots over high extensions of finite fields
On relationship of computational Diffie-Hellman problem and computational square-root exponent problem
Analysis of the fault attack ECDLP over prime field
An efficient collision detection method for computing discrete logarithms with Pollard's rho
Computing discrete logarithms in an interval
An Identity-Based Key Agreement Protocol for the Network Layer
Construction of CM Picard curves
Fast generators for the Diffie-Hellman key agreement protocol and malicious standards
A traceable proxy multisignature scheme based on the elliptic curve cryptosystem
ID-based threshold digital signature schemes on the elliptic curve discrete logarithm problem
Bug Attacks
Elliptic curve cryptography: the serpentine course of a paradigm shift
A key distribution system equivalent to factoring
Structure computation and discrete logarithms in finite abelian \(p\)-groups
Post-quantum static-static key agreement using multiple protocol instances
A discrete logarithm implementation of perfect zero-knowledge blobs
MiMC: efficient encryption and cryptographic hashing with minimal multiplicative complexity
On random walks for Pollard's rho method
Accelerating Pollard's rho algorithm on finite fields
Discrete logarithm based additively homomorphic encryption and secure data aggregation
Unmediated communication in repeated games with imperfect monitoring.
Critical remarks on some public-key cryptosystems
Improved Pollard rho method for computing discrete logarithms over finite extension fields
Discrete logarithm problem using index calculus method
Deterministic root finding over finite fields using Graeffe transforms
Higher \(K\)-groups of smooth projective curves over finite fields
The Elliptic Curve Discrete Logarithm Problem and Equivalent Hard Problems for Elliptic Divisibility Sequences
Computing elliptic curve discrete logarithms with the negation map
A birthday paradox for Markov chains with an optimal bound for collision in the Pollard rho algorithm for discrete logarithm
Point counting on Picard curves in large characteristic
Univariate polynomial factorization over finite fields
On the deterministic complexity of factoring polynomials
Complexity of a determinate algorithm for the discrete logarithm
Bug attacks
The \(\mathbb Q\)-curve construction for endomorphism-accelerated elliptic curves
A taxonomy of pairing-friendly elliptic curves
Efficient Algorithms for Supersingular Isogeny Diffie-Hellman
Parallel use of multiplicative congruential random number generators
A traceable group signature scheme.
Smoothness and factoring polynomials over finite fields
Evaluation of discrete logarithms in a group of 𝑝-torsion points of an elliptic curve in characteristic 𝑝
Analysis of the GHS Weil Descent Attack on the ECDLP over Characteristic Two Finite Fields of Composite Degree
A deterministic version of Pollard's \(p-1\) algorithm
Another look at HMQV
The discrete logarithm problem
Using partial smoothness of \(p-1\) for factoring polynomials modulo \(p\)
A practical anonymous multi-authority e-cash scheme.
Collapse of the hierarchy of constant-depth exact quantum circuits
Analysis and design of a secure key exchange scheme
Trading GRH for algebra: algorithms for factoring polynomials and related structures
Cryptographic aspects of real hyperelliptic curves
Fault-based attack on Montgomery's ladder algorithm
A novel ID-based group signature
Privacy preserving OLAP over distributed XML data: A theoretically-sound secure-multiparty-computation approach
Solving systems of diagonal polynomial equations over finite fields
Sequence acquisition using bit estimation techniques
Constant-round perfect zero-knowledge computationally convincing protocols
Expander graphs based on GRH with an application to elliptic curve cryptography
Prime Numbers with a Fixed Number of One Bits or Zero Bits in Their Binary Representation
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
Bounded tamper resilience: how to go beyond the algebraic barrier
Cryptology: The mathematics of secure communication
One-way permutations on elliptic curves
Several security schemes constructed using ECC-based self-certified public key cryptosystems
Speeding Up the Pollard Rho Method on Prime Fields
Computing Logarithms in Finite Fields of Characteristic Two
Diffie-Hellman Oracles
Isogenies and the discrete logarithm problem in Jacobians of genus 3 hyperelliptic curves
Elliptic curve discrete logarithm problem over small degree extension fields
An algorithm for evaluation of discrete logarithms in some nonprime finite fields
Efficient compression of SIDH public keys
Families of genus 2 curves with small embedding degree
A VLSI architecture for performing finite field arithmetic with reduced table lookup
Standard generators of finite fields and their cyclic subgroups
Fast generation of prime numbers and secure public-key cryptographic parameters.
Polynomial time bounded distance decoding near Minkowski's bound in discrete logarithm lattices
Efficient cryptosystems from \(2^k\)-th power residue symbols
A practical anonymous payment scheme for electronic commerce
Bootstrapping for approximate homomorphic encryption
Computing low-weight discrete logarithms
Algebraic curves and cryptography
Ramanujan's class invariants and their use in elliptic curve cryptography
Subgroup security in pairing-based cryptography
A deterministic algorithm for the discrete logarithm problem in a semigroup
A fast parallel sparse polynomial GCD algorithm
Algorithms for black-box fields and their application to cryptography
A key-exchange system based on imaginary quadratic fields
Applying quick exponentiation for block upper triangular matrices
Studying the performance of artificial neural networks on problems related to cryptography
Privacy-preserving distributed mining of association rules using elliptic-curve cryptosystem and Shamir's secret sharing scheme
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)