Factorization method of quadratic template

Kód výsledku v IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61988987%3A17310%2F17%3AA1801QY7" target="_blank" >RIV/61988987:17310/17:A1801QY7 - isvavai.cz</a>
Výsledek na webu
<a href="http://aip.scitation.org/doi/abs/10.1063/1.4992226" target="_blank" >http://aip.scitation.org/doi/abs/10.1063/1.4992226</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1063/1.4992226" target="_blank" >10.1063/1.4992226</a>

Jazyk výsledku
angličtina
Název v původním jazyce
Factorization method of quadratic template
Popis výsledku v původním jazyce
Multiplication of two numbers is a one-way function in mathematics. Any attempt to distribute the outcome to its roots is called factorization. There are many methods such as Fermat's factorization, Dixońs method or quadratic sieve and GNFS, which use sophisticated techniques fast factorization. All the above methods use the same basic formula differing only in its use. This article discusses a newly designed factorization method. Effective implementation of this method in programs is not important, it only represents and clearly defines its properties.
Název v anglickém jazyce
Factorization method of quadratic template
Popis výsledku anglicky
Multiplication of two numbers is a one-way function in mathematics. Any attempt to distribute the outcome to its roots is called factorization. There are many methods such as Fermat's factorization, Dixońs method or quadratic sieve and GNFS, which use sophisticated techniques fast factorization. All the above methods use the same basic formula differing only in its use. This article discusses a newly designed factorization method. Effective implementation of this method in programs is not important, it only represents and clearly defines its properties.

Rok uplatnění
2017
Kód důvěrnosti údajů
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Podobné výsledky(10)