scientific article; zbMATH DE number 799769
From MaRDI portal
Publication:4847920
zbMath0839.11066MaRDI QIDQ4847920
Publication date: 19 June 1996
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16)
Related Items (19)
New discrete logarithm computation for the medium prime case using the function field sieve ⋮ Factor base discrete logarithms in Kummer extensions ⋮ The generalized Weil pairing and the discrete logarithm problem on elliptic curves ⋮ Index calculus in the trace zero variety ⋮ A General Polynomial Selection Method and New Asymptotic Complexities for the Tower Number Field Sieve Algorithm ⋮ On the signature calculus for finite fields of order square of prime numbers ⋮ Practical fully secure unrestricted inner product functional encryption modulo \(p\) ⋮ Faster individual discrete logarithms in finite fields of composite extension degree ⋮ Towards factoring in \(\mathrm{SL}(2,\mathbb F_{2^n})\) ⋮ Absolute irreducibility of polynomials via Newton polytopes ⋮ Updating key size estimations for pairings ⋮ The Function Field Sieve in the Medium Prime Case ⋮ Indiscreet logarithms in finite fields of small characteristic ⋮ Using number fields to compute logarithms in finite fields ⋮ Faster initial splitting for small characteristic composite extension degree fields ⋮ Refined analysis to the extended tower number field sieve ⋮ Selecting polynomials for the Function Field Sieve ⋮ Asymptotic complexities of discrete logarithm algorithms in pairing-relevant finite fields ⋮ Function field sieve method for discrete logarithms over finite fields
This page was built for publication:
