Nearly sparse linear algebra and application to discrete logarithms computations

DOI10.1142/9789814719261_0008zbMATH Open1365.65130OpenAlexW2343001762MaRDI QIDQ2829802FDOQ2829802

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

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

Mathematics Subject Classification ID

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

Cited In (8)

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

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)