Study of a class of bijective S-boxes constructed with Linear Feedback Shift Registers – Bhupendra Singh
Bhupendra Singh
Master's thesis
Study of a class of bijective S-boxes constructed with Linear Feedback Shift Registers
Study of a class of bijective S-boxes constructed with Linear Feedback Shift Registers
Abstract:
Základními principy návrhu šifry jsou představení zmatek a šíření. V blokových šifrách se S-boxy používají k zavádějte záměnu substitucí. S-boxy jsou implementovány nelineární mapování s určitými žádoucími kryptografickými vlastnostmi k dosažení zmatek. V blokových šifrách založených na substituční permutační síti Používají se bijektivní S-boxy. N × n bijektivní S-boxy jsou mapování od GF (2) ^ n do …moreAbstract:
The foundational principles of cipher design are the introduction of confusion and diffusion. In block ciphers, the S-boxes are used to introduce confusion by substitution. The S-boxes implement nonlinear mapping having certain desirable cryptographic properties to achieve confusion. In ‘substitution permutation network’ based block ciphers, bijective S-boxes are used. The n × n bijective S-boxes are …more
Language used: English
Date on which the thesis was submitted / produced: 11. 12. 2019
Identifier:
https://is.muni.cz/th/o0508/
Thesis defence
- Date of defence: 4. 2. 2020
- Supervisor: prof. RNDr. Václav Matyáš, M.Sc.
- Reader: Mgr. Marek Sýs, Ph.D.
Citation record
ISO 690-compliant citation record:
SINGH, Bhupendra. \textit{Study of a class of bijective S-boxes constructed with Linear Feedback Shift Registers}. Online. Master's thesis. Brno: Masaryk University, Faculty of Informatics. 2019. Available from: https://theses.cz/id/c8o1jv/.
Full text of thesis
Contents of on-line thesis archive
Published in Theses:- světu
Other ways of accessing the text
Institution archiving the thesis and making it accessible: Masarykova univerzita, Fakulta informatikyMasaryk University
Faculty of InformaticsMaster programme / field:
Informatics / Information Technology Security (eng.)
Theses on a related topic
-
Stack number and queue number of graphs
Adam Straka -
Applications of modular functions in algebraic number theory
Ondrej Bínovský -
Analysis of attacks on variations of the Extended Hidden Number Problem
Michal Sládeček -
Estimating the copy-number of chromosomes using next-generation sequencing data
Peter Guman -
Analysis of pseudo-random number generators based on lightweight cryptographic primitives
Michal Hajas -
Analysis of the Linux random number generator in virtualized environment
Radka Cieslarová -
Grammatical Number in English and Czech Nouns
Radka Petrlíková