Nearly sparse linear algebra and application to discrete logarithms computations
From MaRDI portal
Publication:2829802
DOI10.1142/9789814719261_0008zbMath1365.65130OpenAlexW2343001762MaRDI QIDQ2829802
Publication date: 8 November 2016
Published in: Contemporary Developments in Finite Fields and Applications (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-01154879/file/JouxAntoine-v25mars-HAL.pdf
Computational methods for sparse matrices (65F50) Analysis of algorithms (68W40) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Linear equations (linear algebraic aspects) (15A06)
Related Items (6)
Lattice enumeration for tower NFS: a 521-bit discrete logarithm computation ⋮ Higher-dimensional sieving for the number field sieve algorithms ⋮ Lattice enumeration and automorphisms for tower NFS: a 521-bit discrete logarithm computation ⋮ Solving discrete logarithms on a 170-bit MNT curve by pairing reduction ⋮ A Kilobit Hidden SNFS Discrete Logarithm Computation ⋮ Static Scheduling with Load Balancing for Solving Triangular Band Linear Systems on Multicore Processors
This page was built for publication: Nearly sparse linear algebra and application to discrete logarithms computations
