@ARTICLE{Augustynowicz_Paweł_Scalable_2018,
 author={Augustynowicz, Paweł and Kanciak, Krzysztof},
 volume={vol. 64},
 number={No 2},
 journal={International Journal of Electronics and Telecommunications},
 howpublished={online},
 year={2018},
 publisher={Polish Academy of Sciences Committee of Electronics and Telecommunications},
 abstract={This paper addresses the problem of efficient searchingfor Nonlinear Feedback Shift Registers (NLFSRs) with a guaranteed full period. The maximum possible period for an n-bit NLFSR is 2n􀀀1 (an all-zero state is omitted). A multi-stages hybrid algorithm which utilizes Graphics Processor Units (GPU) power was developed for processing data-parallel throughput computation. Usage of the abovementioned algorithm allows giving an extended list of n-bit NLFSR with maximum period for 7 cryptographically applicable types of feedback functions},
 type={Artykuły / Articles},
 title={Scalable Method of Searching for Full-period Nonlinear Feedback Shift Registers with GPGPU. New List of Maximum Period NLFSRs.},
 URL={http://ochroma.man.poznan.pl/Content/103846/PDF/24_1288-4312-1-PB.pdf},
 doi={10.24425/119365},
 keywords={NLFSR, GPGPU, CUDA, Nonlinear Feedback Shift Registers, de Bruijn sequences},
}