Advances in Cryptology - CRYPTO 2003

DOI10.1007/b11817zbMath1122.94402OpenAlexW2480001466WikidataQ56235047 ScholiaQ56235047MaRDI QIDQ5428108

Adi Shamir, Eran Tromer

Publication date: 28 November 2007

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

Full work available at URL: https://doi.org/10.1007/b11817

zbMATH Keywords

factoring large integersNumber Field Sievenew hardware implementationNFS sieving step

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35) Factorization (11Y05)

Related Items (5)

Masking traveling beams: optical solutions for NP-complete problems, trading space for time ⋮ On the cost of computing isogenies between supersingular elliptic curves ⋮ Computational hardness of IFP and ECDLP ⋮ Strategy of Relations Collection in Factoring RSA Modulus ⋮ ECM on Graphics Cards

This page was built for publication: Advances in Cryptology - CRYPTO 2003