Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 217,467,693 papers from all fields of science
Search
Sign In
Create Free Account
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
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
1 relation
Primality test
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2016
Highly Cited
2016
Moving the CFT into the bulk with TT¯\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs…
Lauren McGough
,
M. Mezei
,
H. Verlinde
Journal of High Energy Physics
2016
Corpus ID: 125115149
Recent work by Zamolodchikov and others has uncovered a solvable irrelevant deformation of general 2D CFTs, defined by turning on…
Expand
2015
2015
Framework for Evaluation and Comparison of Primality Testing Algorithms
Cristina-Loredana Duta
,
L. Gheorghe
,
N. Tapus
Computer Science in Cars Symposium
2015
Corpus ID: 15206845
Nowadays, public-key cryptography is widely used to ensure data protection (privacy, integrity, authentication). Public-key…
Expand
2014
2014
Secteur de la construction. Résultats de l’enquête nationale sur les facultés de travail (workability, VOW-QFT).: SPF Emploi, Travail et Concertation sociale
Barbara Lapthorn
,
Catherine Hellemans
,
L. Braeckman
,
N. Delobbe
2014
Corpus ID: 182440386
2014
2014
Secteur du nettoyage industriel. Résultats de l’enquête nationale sur les facultés de travail (workability, VOW-QFT).: SPF Emploi, Travail et Concertation sociale
Barbara Lapthorn
,
Catherine Hellemans
,
L. Braeckman
,
N. Delobbe
2014
Corpus ID: 181459684
2008
2008
Inefficacious Conditions of the Frobenius Primality Test and Grantham's Problem
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…
Expand
2007
2007
Quadratic Frobenius test and cyclotomic polynomials(Computer Algebra - Design of Algorithms, Implementations and Applications)
篠原 直行
2007
Corpus ID: 120745928
2005
2005
A Simplified Quadratic Frobenius Primality Test
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…
Expand
2003
2003
An Extended Quadratic Frobenius Primality Test with Average and Worst Case Error Estimates
I. Damgård
,
G. Frandsen
International Symposium on Fundamentals of…
2003
Corpus ID: 17489749
We present an Extended Quadratic Frobenius Primality Test (EQFT), which is related to the Miller-Rabin test and the Quadratic…
Expand
2001
2001
An Extended Quadratic Frobenius Primality Test with Average Case Error Estimates
I. Damgård
,
G. Frandsen
IACR Cryptology ePrint Archive
2001
Corpus ID: 3232420
We present an Extended Quadratic Frobenius Primality Test (EQFT), which is related to the Miller-Rabin test and the Quadratic…
Expand
2000
2000
Diseño robusto del predictor de Smith para procesos con incertidumbres y retardo variable
Guillén Martínez
,
J. Carlos
2000
Corpus ID: 190677326
En el convencimiento de que el predictor de Smith puede jugar en el futuro un importante papel en el control de sistemas con…
Expand
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)
ACCEPT & CONTINUE