Search results


  • Journals
  • Date

Search results

Number of results: 1
items per page: 25 50 75
Sort by:


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
Go to article

This page uses 'cookies'. Learn more