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)

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
Generating pairing-friendly parameters for the CM construction of genus 2 curves over prime fields
A note on Girault's self-certified model
Towards isogeny-based password-authenticated key establishment
The Pohlig-Hellman method generalized for group structure computation
On the discrete logarithm problem in finite fields of fixed characteristic
Generating Genus Two Hyperelliptic Curves over Large Characteristic Finite Fields
Factor base discrete logarithms in Kummer extensions
Constructing nonresidues in finite fields and the extended Riemann hypothesis
A new password authentication mechanism based on two phases encryption
Fault attacks on hyperelliptic curve discrete logarithm problem over binary field
Nonlinear vectorial primitive recursive sequences
Elliptic curve cryptosystems and their implementation
An authentication-combined access control scheme using a one-way function
Controlling access in tree hierarchies
Solving systems of linear equations arising in the computation of logarithms in a finite prime field
Über die mathematischen Grundlagen einiger Chiffrierverfahren
Title not available (Why is that?)
A serial version of the Pohlig-Hellman algorithm for computing discrete logarithms
A construction for authentication/secrecy codes from certain combinatorial designs
Scalable zero knowledge via cycles of elliptic curves
Analysis of the Herlestam and Johannesson discrete logarithm scheme in \(GF(2^ N)\) for large N
Computing integral points on hyperelliptic curves using quadratic Chabauty
Prime-number algorithm for public-key systems
On computing logarithms over GF(2**p)
Efficient Finite Fields in the Maxima Computer Algebra System
A low-memory algorithm for point counting on Picard curves
Polylogarithmic two-round argument systems
Indiscreet logarithms in finite fields of small characteristic
A simplified approach to rigorous degree 2 elimination in discrete logarithm algorithms
On the security of OSIDH
Security analysis of discrete logarithm based cryptosystems
Ephemeral key recovery using index calculus method
A fusion algorithm for solving the hidden shift problem in finite abelian groups
Improved torsion-point attacks on SIDH variants
The GN-authenticated key agreement
Faster Halvings in Genus 2
Algorithmic aspects of elliptic bases in finite field discrete logarithm algorithms
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
Cryptographic group and semigroup actions
Bitcoin security with a twisted Edwards curve
SiGamal: a supersingular isogeny-based PKE and its application to a PRF
Curves with Fast Computations in the First Pairing Group
Encoding-free ElGamal-type encryption schemes on elliptic curves
On a new cipher system over Galois fields of order 27
Cryptographic multilinear maps using pro-\(p\) groups
Faster Privacy-Preserving Location Proximity Schemes
A signature scheme with a fuzzy private key
A conference key distribution system based on cross-product
Adversary-dependent lossy trapdoor function from hardness of factoring semi-smooth RSA subgroup moduli
Preventing unknown key-share attack using cryptographic bilinear maps
ON BOUNDS FOR BALANCED EMBEDDING DEGREE
On the discrete logarithm problem in the ideal class group of multiquadratic fields
SQIsignHD: new dimensions in cryptography
On the efficient generation of prime-order elliptic curves
Fast subgroup membership testings for \(\mathbb{G}_1, \mathbb{G}_2\) and \(\mathbb{G}_T\) on pairing-friendly curves
Quantum algorithms for computing general discrete logarithms and orders with tradeoffs
On the multi-user security of short Schnorr signatures with preprocessing
A DSA-like digital signature protocol
Isogeny-based key compression without pairings
An analysis of the algebraic group model
Cryptanalysis of algebraic verifiable delay functions
DiSSECT: distinguisher of standard and simulated elliptic curves via traits
Insecure primitive elements in an ElGamal signature protocol
Interpolation of the Zech's logarithm: explicit forms
ECDSA-Verifiable Signcryption Scheme with Signature Verification on the Signcrypted Message
CPP: towards comprehensive privacy preserving for query processing in information networks
Solving modular cubic equations with Coppersmith's method
Compressed M-SIDH: an instance of compressed SIDH-like schemes with isogenies of highly composite degrees
Breaking SIDH in polynomial time
Two phases encryption and its applications
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

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)