Solving discrete logarithms on a 170-bit MNT curve by pairing reduction (Q1698673): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2963925737 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1605.07746 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Function field sieve method for discrete logarithms over finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving NFS for the Discrete Logarithm Problem in Non-prime Finite Fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Heuristic Quasi-Polynomial Algorithm for Discrete Logarithm in Finite Fields of Small Characteristic / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Tower Number Field Sieve / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pairing-Friendly Elliptic Curves of Prime Order / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Arithmetic Operators for Computing the ηT Pairing in Characteristic Three / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for resultants of univariate and bivariate polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Elliptic Curve Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4783728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4474196 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elliptic curves suitable for pairing based cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Public Key Cryptography - PKC 2006 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Homogeneous Linear Equations Over GF(2) via Block Wiedemann Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Building curves with arbitrary small MOV degree over finite prime fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Implementation of the Number Field Sieve / rank
 
Normal rank
Property / cites work
 
Property / cites work: HT90 and ``simplest'' number fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Number Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: A taxonomy of pairing-friendly elliptic curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Remark Concerning m-Divisibility and the Discrete Logarithm in the Divisor Class Group of Curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordinary Abelian varieties having small embedding degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Collecting relations for the number field sieve in / rank
 
Normal rank
Property / cites work
 
Property / cites work: Breaking ‘128-bit Secure’ Supersingular Binary Curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Individual Discrete Logarithms Faster in $${{\mathrm{GF}}}(p^n)$$ with the NFS-DL Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Breaking Pairing-Based Cryptosystems Using η T Pairing over GF(397) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extended Tower Number Field Sieve with Application to Finite Fields of Arbitrary Composite Extension Degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2739458 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Number Field Sieve in the Medium Prime Case / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Special Number Field Sieve in $\mathbb{F}_{p^{n}}$ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nearly sparse linear algebra and application to discrete logarithms computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extended Tower Number Field Sieve: A New Complexity for the Medium Prime Case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducing elliptic curve logarithms to logarithms in a finite field / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2763028 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4745878 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving a Discrete Logarithm Problem with Auxiliary Input on a 160-Bit Elliptic Curve / rank
 
Normal rank
Property / cites work
 
Property / cites work: A General Polynomial Selection Method and New Asymptotic Complexities for the Tower Number Field Sieve Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Complexity Trade-Offs for the (Multiple) Number Field Sieve Algorithm in Non-Prime Fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete logarithms and local units / rank
 
Normal rank
Property / cites work
 
Property / cites work: Virtual logarithms / rank
 
Normal rank

Latest revision as of 03:38, 15 July 2024

scientific article
Language Label Description Also known as
English
Solving discrete logarithms on a 170-bit MNT curve by pairing reduction
scientific article

    Statements

    Solving discrete logarithms on a 170-bit MNT curve by pairing reduction (English)
    0 references
    0 references
    0 references
    0 references
    16 February 2018
    0 references
    discrete logarithm
    0 references
    finite field
    0 references
    number field sieve
    0 references
    MNT elliptic curve
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers