Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the gaussian integer method (Q4794653): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4341796 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4273683 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4341743 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4273681 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2739444 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3374895 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4502498 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast evaluation of logarithms in fields of characteristic two / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete logarithms in \(\mathrm{GF}(p)\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4536282 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4375599 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4343449 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4249695 / 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: Q4375601 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4847909 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete Logarithms in $GF ( P )$ Using the Number Field Sieve / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4318705 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattice reduction: a toolbox for the cryptoanalyst / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2998505 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computation of discrete logarithms in prime fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4279567 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The development of the number field sieve / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factoring polynomials with rational coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Factorization of the Ninth Fermat Number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2757235 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3726006 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete logarithms and local units / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4375624 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Multiple Polynomial Quadratic Sieve / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4375628 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4249351 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:57, 5 June 2024

scientific article; zbMATH DE number 1871627
Language Label Description Also known as
English
Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the gaussian integer method
scientific article; zbMATH DE number 1871627

    Statements

    Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the gaussian integer method (English)
    0 references
    0 references
    0 references
    19 February 2003
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references