Matematicheskie Voprosy Kriptografii [Mathematical Aspects of Cryptography]
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Mat. Vopr. Kriptogr.:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Matematicheskie Voprosy Kriptografii [Mathematical Aspects of Cryptography], 2017, Volume 8, Issue 1, Pages 51–68
DOI: https://doi.org/10.4213/mvk214 (Mi mvk214) 		 
Analyzing the influence of linear redundancy in S-boxes on the affine equivalence within XSL-like round functions

Nguyen Bui Cuong, Nguyen Van Long, Hoang Dinh Linh

Institute of Cryptography Science and Technology, Government Information Security Committee, Viet Nam
Full-text PDF (271 kB)
References:
PDF
HTML
DOI: https://doi.org/10.4213/mvk214
Abstract: We show that S-boxes based on finite field inversion always possess complete linear redundancy. Next, we consider the influence of linear redundancy of S-boxes on the affine equivalence of component functions within XSL-like round functions in the general case. Then, we propose an effective practical approach to test this. Finally, some experimental results on the round functions within the Kuznyechik and AES are presented.
Key words: Boolean functions, S-boxes, round function, block cipher, affine equivalence, linear redundancy.
Received 10.VI.2016
Bibliographic databases:
Document Type: Article
UDC: 519.719.2
Language: English
Citation: Nguyen Bui Cuong, Nguyen Van Long, Hoang Dinh Linh, “Analyzing the influence of linear redundancy in S-boxes on the affine equivalence within XSL-like round functions”, Mat. Vopr. Kriptogr., 8:1 (2017), 51–68
Citation in format AMSBIB
\Bibitem{CuoLonLin17}
\by Nguyen Bui Cuong, Nguyen Van Long, Hoang Dinh Linh
\paper Analyzing the influence of linear redundancy in S-boxes on the affine equivalence within XSL-like round functions
\jour Mat. Vopr. Kriptogr.
\yr 2017
\vol 8
\issue 1
\pages 51--68
\mathnet{http://mi.mathnet.ru/mvk214}
\crossref{https://doi.org/10.4213/mvk214}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=3682438}
\elib{https://elibrary.ru/item.asp?id=29864939}
Linking options:
  • https://www.mathnet.ru/eng/mvk214
  • https://doi.org/10.4213/mvk214
  • https://www.mathnet.ru/eng/mvk/v8/i1/p51
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Математические вопросы криптографии
    Statistics & downloads:
    Abstract page:943
    Full-text PDF :223
    References:43
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024