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)

A note on Girault's self-certified model
Expander graphs based on GRH with an application to elliptic curve cryptography
Isogenies and the discrete logarithm problem in Jacobians of genus 3 hyperelliptic curves
Analysis of the Herlestam and Johannesson discrete logarithm scheme in \(GF(2^ N)\) for large N
A VLSI architecture for performing finite field arithmetic with reduced table lookup
A construction for authentication/secrecy codes from certain combinatorial designs
A key distribution system equivalent to factoring
A key-exchange system based on imaginary quadratic fields
Univariate polynomial factorization over finite fields
Über die mathematischen Grundlagen einiger Chiffrierverfahren
On computing logarithms over GF(2**p)
Smoothness and factoring polynomials over finite fields
Cryptology: The mathematics of secure communication
The Pohlig-Hellman method generalized for group structure computation
Elliptic curve cryptosystems and their implementation
An authentication-combined access control scheme using a one-way function
Controlling access in tree hierarchies
A practical anonymous multi-authority e-cash scheme.
Unmediated communication in repeated games with imperfect monitoring.
A traceable group signature scheme.
Privacy-preserving distributed mining of association rules using elliptic-curve cryptosystem and Shamir's secret sharing scheme
Bootstrapping for approximate homomorphic encryption
Factor base discrete logarithms in Kummer extensions
Nonlinear vectorial primitive recursive sequences
Scalable zero knowledge via cycles of elliptic curves
Post-quantum static-static key agreement using multiple protocol instances
Computing low-weight discrete logarithms
Collisions in fast generation of ideal classes and points on hyperelliptic and elliptic curves
Indiscreet logarithms in finite fields of small characteristic
A serial version of the Pohlig-Hellman algorithm for computing discrete logarithms
Prime-number algorithm for public-key systems
A practical anonymous payment scheme for electronic commerce
Fast generation of prime numbers and secure public-key cryptographic parameters.
Complexity of a determinate algorithm for the discrete logarithm
Elliptic curve discrete logarithm problem over small degree extension fields
Generating pairing-friendly parameters for the CM construction of genus 2 curves over prime fields
A novel ID-based group signature
A fast parallel sparse polynomial GCD algorithm
Polynomial time bounded distance decoding near Minkowski's bound in discrete logarithm lattices
Survey on SAP and its application in public-key cryptography
Orienting supersingular isogeny graphs
Towards isogeny-based password-authenticated key establishment
Quantum algorithms for computing general discrete logarithms and orders with tradeoffs
Isogeny-based key compression without pairings
Interpolation of the Zech's logarithm: explicit forms
A fusion algorithm for solving the hidden shift problem in finite abelian groups
SimS: a simplification of SiGamal
Memory optimization techniques for computing discrete logarithms in compressed SIKE
Improved torsion-point attacks on SIDH variants
A deterministic algorithm for the discrete logarithm problem in a semigroup
On the multi-user security of short Schnorr signatures with preprocessing
CPP: towards comprehensive privacy preserving for query processing in information networks
On computing the degree of a Chebyshev polynomial from its value
A taxonomy of pairing-friendly elliptic curves
One-way permutations on elliptic curves
A conference key distribution system based on cross-product
Analysis and design of a secure key exchange scheme
Efficient cryptosystems from \(2^k\)-th power residue symbols
Elliptic curve cryptography: the serpentine course of a paradigm shift
A low-memory algorithm for point counting on Picard curves
The GN-authenticated key agreement
Several security schemes constructed using ECC-based self-certified public key cryptosystems
Effective compression maps for torus-based cryptography
Standard generators of finite fields and their cyclic subgroups
SiGamal: a supersingular isogeny-based PKE and its application to a PRF
On random walks for Pollard's rho method
A new password authentication mechanism based on two phases encryption
A signature scheme with a fuzzy private key
The discrete logarithm problem
Adversary-dependent lossy trapdoor function from hardness of factoring semi-smooth RSA subgroup moduli
Preventing unknown key-share attack using cryptographic bilinear maps
Efficient Algorithms for Supersingular Isogeny Diffie-Hellman
Taking roots over high extensions of finite fields
General secret sharing based on the Chinese remainder theorem with applications in e-voting
Subgroup security in pairing-based cryptography
MiMC: efficient encryption and cryptographic hashing with minimal multiplicative complexity
Computing integral points on hyperelliptic curves using quadratic Chabauty
Encoding-free ElGamal-type encryption schemes on elliptic curves
On relationship of computational Diffie-Hellman problem and computational square-root exponent problem
Deterministic root finding over finite fields using Graeffe transforms
Ephemeral key recovery using index calculus method
Cryptographic aspects of real hyperelliptic curves
Structure computation and discrete logarithms in finite abelian \(p\)-groups
Trading GRH for algebra: algorithms for factoring polynomials and related structures
Using partial smoothness of p-1 for factoring polynomials modulo p
Bug attacks
The Q-curve construction for endomorphism-accelerated elliptic curves
Computing Logarithms in Finite Fields of Characteristic Two
A double large prime variation for small genus hyperelliptic index calculus
Security analysis of discrete logarithm based cryptosystems
Diffie-Hellman Oracles
Algorithms for black-box fields and their application to cryptography
Collapse of the hierarchy of constant-depth exact quantum circuits
Efficient Finite Fields in the Maxima Computer Algebra System
An Identity-Based Key Agreement Protocol for the Network Layer
Performance analysis of index calculus method
A deterministic version of Pollard's p-1 algorithm
Bug Attacks
ECDSA-Verifiable Signcryption Scheme with Signature Verification on the Signcrypted Message
Speeding Up the Pollard Rho Method on Prime Fields

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)