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)

Diffie-Hellman Oracles
Breaking SIDH in polynomial time
Low complexity normal bases for \(F_{2^{mn}}\)
Low complexity normal bases
On the security of OSIDH
Security analysis of discrete logarithm based cryptosystems
Performance analysis of index calculus method
Effective compression maps for torus-based cryptography
A fusion algorithm for solving the hidden shift problem in finite abelian groups
Constructing hyperelliptic curves of genus 2 suitable for cryptography
Ephemeral key recovery using index calculus method
On index calculus algorithms for subfield curves
A double large prime variation for small genus hyperelliptic index calculus
Improved torsion-point attacks on SIDH variants
An algorithm for evaluation of discrete logarithms in some nonprime finite fields
The GN-authenticated key agreement
A VLSI architecture for performing finite field arithmetic with reduced table lookup
Families of genus 2 curves with small embedding degree
Taking roots over high extensions of finite fields
Analysis of the fault attack ECDLP over prime field
An efficient collision detection method for computing discrete logarithms with Pollard's rho
Efficient compression of SIDH public keys
On relationship of computational Diffie-Hellman problem and computational square-root exponent problem
Standard generators of finite fields and their cyclic subgroups
Fast generation of prime numbers and secure public-key cryptographic parameters.
Computing discrete logarithms in an interval
Polynomial time bounded distance decoding near Minkowski's bound in discrete logarithm lattices
Faster Halvings in Genus 2
Efficient cryptosystems from \(2^k\)-th power residue symbols
Memory optimization techniques for computing discrete logarithms in compressed SIKE
SimS: a simplification of SiGamal
On computing the degree of a Chebyshev polynomial from its value
Fast generators for the Diffie-Hellman key agreement protocol and malicious standards
A traceable proxy multisignature scheme based on the elliptic curve cryptosystem
A practical anonymous payment scheme for electronic commerce
ID-based threshold digital signature schemes on the elliptic curve discrete logarithm problem
An Identity-Based Key Agreement Protocol for the Network Layer
Algorithmic aspects of elliptic bases in finite field discrete logarithm algorithms
Construction of CM Picard curves
Bootstrapping for approximate homomorphic encryption
Computing low-weight discrete logarithms
Bug Attacks
Ramanujan's class invariants and their use in elliptic curve cryptography
Cryptographic group and semigroup actions
Elliptic curve cryptography: the serpentine course of a paradigm shift
A key distribution system equivalent to factoring
Algebraic curves and cryptography
Subgroup security in pairing-based cryptography
Post-quantum static-static key agreement using multiple protocol instances
Bitcoin security with a twisted Edwards curve
Structure computation and discrete logarithms in finite abelian \(p\)-groups
A discrete logarithm implementation of perfect zero-knowledge blobs
A deterministic algorithm for the discrete logarithm problem in a semigroup
Accelerating Pollard's rho algorithm on finite fields
Discrete logarithm based additively homomorphic encryption and secure data aggregation
MiMC: efficient encryption and cryptographic hashing with minimal multiplicative complexity
On random walks for Pollard's rho method
A key-exchange system based on imaginary quadratic fields
A fast parallel sparse polynomial GCD algorithm
Applying quick exponentiation for block upper triangular matrices
Studying the performance of artificial neural networks on problems related to cryptography
Unmediated communication in repeated games with imperfect monitoring.
Algorithms for black-box fields and their application to cryptography
SiGamal: a supersingular isogeny-based PKE and its application to a PRF
Privacy-preserving distributed mining of association rules using elliptic-curve cryptosystem and Shamir's secret sharing scheme
Critical remarks on some public-key cryptosystems
Survey on SAP and its application in public-key cryptography
Orienting supersingular isogeny graphs
Generating pairing-friendly parameters for the CM construction of genus 2 curves over prime fields
Encoding-free ElGamal-type encryption schemes on elliptic curves
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
Curves with Fast Computations in the First Pairing Group
A note on Girault's self-certified model
Higher \(K\)-groups of smooth projective curves over finite fields
Towards isogeny-based password-authenticated key establishment
The Pohlig-Hellman method generalized for group structure computation
Computing elliptic curve discrete logarithms with the negation map
On a new cipher system over Galois fields of order 27
The Elliptic Curve Discrete Logarithm Problem and Equivalent Hard Problems for Elliptic Divisibility Sequences
A signature scheme with a fuzzy private key
Generating Genus Two Hyperelliptic Curves over Large Characteristic Finite Fields
Cryptographic multilinear maps using pro-\(p\) groups
On the discrete logarithm problem in finite fields of fixed characteristic
A conference key distribution system based on cross-product
Faster Privacy-Preserving Location Proximity Schemes
Adversary-dependent lossy trapdoor function from hardness of factoring semi-smooth RSA subgroup moduli
Preventing unknown key-share attack using cryptographic bilinear maps
Univariate polynomial factorization over finite fields
Point counting on Picard curves in large characteristic
Factor base discrete logarithms in Kummer extensions
ON BOUNDS FOR BALANCED EMBEDDING DEGREE
Complexity of a determinate algorithm for the discrete logarithm
On the discrete logarithm problem in the ideal class group of multiquadratic fields
Bug attacks
The Q-curve construction for endomorphism-accelerated elliptic curves
SQIsignHD: new dimensions in cryptography
On the deterministic complexity of factoring polynomials
A taxonomy of pairing-friendly elliptic curves

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)