Nearly sparse linear algebra and application to discrete logarithms computations

DOI10.1142/9789814719261_0008MaRDI QIDQ2829802zbMATH OpenOpenAlexFDO

Authors Antoine Joux, Cécile Pierrot

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

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear equations (linear algebraic aspects) (15A06) Computational methods for sparse matrices (65F50) Analysis of algorithms (68W40) Cryptography (94A60)

Recommendations

• scientific article; zbMATH DE number 503245
• scientific article; zbMATH DE number 1253961
• Solving Homogeneous Linear Equations Over GF(2) via Block Wiedemann Algorithm
• scientific article; zbMATH DE number 503196
• Version of block Lanczos-type algorithm for solving sparse linear systems

Cited in

(9)

• Solving discrete logarithms on a 170-bit MNT curve by pairing reduction
• Analysis of Coppersmith's Block Wiedemann Algorithm for the Parallel Solution of Sparse Linear Systems
• Static Scheduling with Load Balancing for Solving Triangular Band Linear Systems on Multicore Processors
• A Kilobit Hidden SNFS Discrete Logarithm Computation
• 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
• Cryptanalysis of \texttt{Elisabeth-4}
• On the complexity formulae of the number field sieve and its variants

This page was built for publication: Nearly sparse linear algebra and application to discrete logarithms computations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2829802)