Hardware to solve sparse systems of linear equations over GF(2).

DOI10.1007/978-3-540-45238-6_5MaRDI QIDQ5187948zbMATH OpenOpenAlexFDO

Authors Rainer Steinwandt, Willi Geiselmann

Publication date 9 March 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-45238-6_5

zbMATH Keywords

factorizationlinear algebranumber field sieveRSA

Mathematics Subject Classification ID

Factorization (11Y05) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35) Cryptography (94A60)

Recommendations

• A Dedicated Sieving Hardware
• Non-wafer-Scale Sieving Hardware for the NFS: Another Attempt to Cope with 1024-Bit
• Experiments on the Linear Algebra Step in the Number Field Sieve
• Topics in Cryptology – CT-RSA 2004
• scientific article; zbMATH DE number 503245

Cited in

(2)

• Optimization strategies for hardware-based cofactorization
• Dedicated hardware for linearly-scaling algorithms in condensed-matter physics

This page was built for publication: Hardware to solve sparse systems of linear equations over GF(2).

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