The number field sieve for integers of low weight
From MaRDI portal
Publication:3584792
DOI10.1090/S0025-5718-09-02198-XzbMATH Open1213.11201MaRDI QIDQ3584792FDOQ3584792
Publication date: 30 August 2010
Published in: Mathematics of Computation (Search for Journal in Brave)
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Factorization (11Y05) Number-theoretic algorithms; complexity (11Y16) Algebraic number theory computations (11Y40)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The development of the number field sieve
- On a problem of Oppenheim concerning Factorisatio Numerorum
- Chebotarëv and his density theorem
- Cryptography and Coding
- Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the gaussian integer method
- A Further Generalization of an Irreducibility Theorem of A. Cohn
- Discrete logarithms and local units
- Algorithms – ESA 2005
- Public Key Cryptography - PKC 2006
Cited In (11)
- Elliptic curve cryptography: the serpentine course of a paradigm shift
- Updating key size estimations for pairings
- The weighted linear sieve and Selberg's $λ^2$-method
- RNS arithmetic in 𝔽 pk and application to fast pairing computation
- Title not available (Why is that?)
- Title not available (Why is that?)
- Cocks-Pinch curves of embedding degrees five to eight and optimal ate pairing computation
- Comparing two pairing-based aggregate signature schemes
- An Experiment of Number Field Sieve over GF(p) of Low Hamming Weight Characteristic
- Title not available (Why is that?)
- Montgomery's weighted sieve for dimension two
This page was built for publication: The number field sieve for integers of low weight
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3584792)
