Implementation and security analysis of construction algorithm of Sigma-LFSR

Mgr. Susil Kumar Bishoi

Master's thesis

Abstract:

The software implementation LFSR is inefficient for modern processors as it produces only one new bit per step. This limits the speed of operation and resource utilization. So, word based LFSRs (σ-LFSRs) are so popular in case of software implementation. Both search algorithm and construction algorithm for σ-LFSRs provide a good collection of primitive σ-LFSRs and they are efficient in both hardware and software. However, the construction algorithm for σ-LFSRs using Horner’s form of polynomial generates efficient σ-LFSRs with lesser complexity of arithmetic operations. The aim of this thesis is the implementation of the construction algorithm on a 32/64-bit PC platform and then security analysis with respect to the cryptographic point of view. This thesis also contains the complexity analysis of the search algorithm for σ-LFSRs and the comparative performance of the construction algorithm with the search algorithm for primitive σ-LFSRs.

Keywords

Cryptography, Primitive LFSR, Pseudo Random Number Generator and σ-LFSR

Language used: English

Date on which the thesis was submitted / produced: 4. 1. 2017

Thesis defence

• Date of defence: 10. 2. 2017
• Supervisor: prof. RNDr. Václav Matyáš, M.Sc.
• Reader: Mgr. Marek Sýs, Ph.D.

Masaryk University

Faculty of Informatics

Master programme / field:
Informatics / Information Technology Security (eng.)