The number field sieve for integers of low weight

DOI10.1090/S0025-5718-09-02198-XzbMath1213.11201MaRDI QIDQ3584792

Oliver Schirokauer

Publication date: 30 August 2010

Published in: Mathematics of Computation (Search for Journal in Brave)

zbMATH Keywords

discrete logarithminteger factorizationnumber field sieve

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Number-theoretic algorithms; complexity (11Y16) Algebraic number theory computations (11Y40) Factorization (11Y05)

Related Items

Cocks-Pinch curves of embedding degrees five to eight and optimal ate pairing computation ⋮ Elliptic curve cryptography: the serpentine course of a paradigm shift ⋮ An Experiment of Number Field Sieve over GF(p) of Low Hamming Weight Characteristic ⋮ RNS arithmetic in 𝔽 pk and application to fast pairing computation ⋮ Comparing two pairing-based aggregate signature schemes ⋮ Updating key size estimations for pairings

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The development of the number field sieve
• On a problem of Oppenheim concerning Factorisatio Numerorum
• Chebotarëv and his density theorem
• A Further Generalization of an Irreducibility Theorem of A. Cohn
• Discrete logarithms and local units
• Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the gaussian integer method
• Algorithms – ESA 2005
• Cryptography and Coding
• Public Key Cryptography - PKC 2006