Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Quadratic Frobenius test

Known as: QFT 
The Quadratic Frobenius Test (QFT) is a probabilistic primality test to test whether a number is a probable prime. It is named after Ferdinand Georg… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2016
Highly Cited
2016
Recent work by Zamolodchikov and others has uncovered a solvable irrelevant deformation of general 2D CFTs, defined by turning on… Expand
  • figure 1
  • figure 2
Is this relevant?
2015
2015
Nowadays, public-key cryptography is widely used to ensure data protection (privacy, integrity, authentication). Public-key… Expand
  • figure 1
  • figure 3
  • figure 2
  • table I
  • table II
Is this relevant?
2008
2008
  • N. Shinohara
  • IEICE Trans. Fundam. Electron. Commun. Comput…
  • 2008
  • Corpus ID: 42911636
For determining whether an input number is prime, there are two kinds of algorithms, a primality test and a primality proving. A… Expand
Is this relevant?
2005
2005
  • M. Seysen
  • IACR Cryptol. ePrint Arch.
  • 2005
  • Corpus ID: 7042498
The publication of the quadratic Frobenius primality test [6] has stimulated a lot of research, see e.g. [4, 10, 11]. In this… Expand
  • table 1
  • table 2
  • table 3
Is this relevant?
2003
2003
We present an Extended Quadratic Frobenius Primality Test (EQFT), which is related to the Miller-Rabin test and the Quadratic… Expand
  • figure 1
  • figure 2
  • table 1
  • table 2
  • table 3
Is this relevant?
2001
2001
We present an Extended Quadratic Frobenius Primality Test (EQFT), which is related to the Miller-Rabin test and the Quadratic… Expand
  • figure 1
  • figure 2
  • table 1
  • table 2
  • table 3
Is this relevant?
2000
2000
En el convencimiento de que el predictor de Smith puede jugar en el futuro un importante papel en el control de sistemas con… Expand
Is this relevant?