olemus
täisarvu tükeldamine teguriteks,
st arvudeks, mille korrutis võrdub etteantud täisarvuga
= the decomposition of a positive integer into a product of smaller integers

keerukus
kõige raskem on tegurdada kahe suure algarvu korrutist ja seda asjaolu rakendatakse mitmetes krüptoprotokollides

ülevaateid
http://mathworld.wolfram.com/PrimeFactorization.html

http://citeseerx.ist.psu.edu/viewdoc/download;jsessionid=40F30359FA82BE5500BFB188F85B7630?doi=10.1.1.117.1230&rep=rep1&type=pdf

https://en.wikipedia.org/wiki/Integer_factorization

https://en.wikipedia.org/wiki/Integer_factorization_records

https://cp-algorithms.com/algebra/factorization.html

https://en.wikipedia.org/wiki/Euler%27s_factorization_method

https://en.wikipedia.org/wiki/Pollard%27s_rho_algorithm

https://www.fdi.ucm.es/profesor/m_alonso/Documentos/factorizacion/arjlensfac.pdf

https://eprint.iacr.org/2017/1087.pdf

vt ka
- tegurduskrüptograafia