Skip to search formSkip to main contentSkip to account menu

Special number field sieve

Known as: SNFS 
In number theory, a branch of mathematics, the special number field sieve (SNFS) is a special-purpose integer factorization algorithm. The general… 
Wikipedia (opens in a new tab)

Related topics

Related topics

15 relations
Algorithmic efficiencyComputational complexity theoryDistributed computingGeneral number field sieve

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Proposal for enhancement of antihydrogen ion production in the GBAR experiment
The production of antihydrogen ions (H+ ) in the GBAR experiment will occur via a two step charge exchange process. In a first… 
2016
2016
Valid inequalities for separable concave constraints with indicator variables
We study valid inequalities for optimization models that contain both binary indicator variables and separable concave… 
2014
2014
Spice-compatible nonlinear Op Amp and CFOA macro-models
This paper describes SPICE-compatible macromodels to model the nonlinear behavior of operational amplifiers (Op Amp) and current… 
2013
2013
Accuracy vs simulation speed trade-off enhancements in the generation of chaotic attractors
In this paper, the trade-off between accuracy and simulation speed in the generation of muti-scroll chaotic attractors at 1-D is… 
2011
2011
On the trade-off between the number of scrolls and the operating frequency of the chaotic attractors
A trade-off analysis on the number of scrolls and the operating frequency is presented. To do so, nonlinear system parameters… 
2011
2011
SNF Project Locomotion: Progress report 2008-2009
Summary of results (project period 1. 10. 2008 - 30. 9. 2009) of SNFS Project "From locomotion to cognition" The research that… 
2008
2008
Special number field sieve
Integer factorization is a problem not yet solved for arbitrary integers. Huge integers are therefore widely used for encrypting… 
2003
2003
Isolating critical cases for reciprocals using integer factorization
  • J. Harrison
  • Proceedings 16th IEEE Symposium on Computer…
  • 2003
  • Corpus ID: 7561561
One approach to testing and/or proving correctness of a floating-point algorithm computing a function f is based on finding input… 
2002
2002
The Special Function Field Sieve
Let p be a prime number and n a positive integer, and let q=pn. Adleman and Huang [Inform. and Comput., 151 (1999), pp. 5--16… 
2000
2000
New hope for reimbursement rates to SNFs.
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)