Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

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… 
2015
2015
Nowadays, public-key cryptography is widely used to ensure data protection (privacy, integrity, authentication). Public-key… 
2008
2008
  • N. Shinohara
  • IEICE Transactions on Fundamentals of Electronics…
  • 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… 
2005
2005
  • M. Seysen
  • IACR Cryptology ePrint Archive
  • 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… 
2003
2003
We present an Extended Quadratic Frobenius Primality Test (EQFT), which is related to the Miller-Rabin test and the Quadratic… 
2001
2001
We present an Extended Quadratic Frobenius Primality Test (EQFT), which is related to the Miller-Rabin test and the Quadratic… 
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…