An Experiment of Number Field Sieve over GF(p) of Low Hamming Weight Characteristic

DOI10.1007/978-3-642-20901-7_11zbMath1271.11120OpenAlexW1794412549MaRDI QIDQ3005589

Kenichiro Hayasaka, Tsuyoshi Takagi

Publication date: 8 June 2011

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

Full work available at URL: https://doi.org/10.1007/978-3-642-20901-7_11

zbMATH Keywords

discrete logarithmnumber field sievelow Hamming weight

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Number-theoretic algorithms; complexity (11Y16) Authentication, digital signatures and secret sharing (94A62)

Related Items (1)

A Brief History of Pairings

Uses Software

• PARI/GP

Cites Work

• Unnamed Item
• The development of the number field sieve
• Discrete logarithms in \(\mathrm{GF}(p)\)
• Factoring polynomials with rational coefficients
• Computation of discrete logarithms in prime fields
• On polynomial selection for the general number field sieve
• The number field sieve for integers of low weight
• 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
• Reduction of Huge, Sparse Matrices over Finite Fields Via Created Catastrophes
• Discrete Logarithms in $GF ( P )$ Using the Number Field Sieve
• Virtual logarithms

This page was built for publication: An Experiment of Number Field Sieve over GF(p) of Low Hamming Weight Characteristic