@article{Rónyai_Szántó_2012, title={Primer-Field Complete Functions and Factoring Polynomials over Finite Fields}, volume={15}, url={https://www.cai.sk/ojs/index.php/cai/article/view/680}, abstractNote={We relate the arithmetic straight-line complexity over a field GF(p) (p is a prime) of the parity function lp to the Boolean complexity of the problem of factoring polynomials over finite fields of characteristic p. A procedure is described which converts an arithmetic straight-line program for lp into a factoring algorithm.&nbsp; As a consequence, a short straight-line program for lp would imply the existence of an efficient factoring method.}, number={6}, journal={COMPUTING AND INFORMATICS}, author={Rónyai, L. and Szántó, A.}, year={2012}, month={Mar.}, pages={571–577} }