On complexity of round transformations

DOI10.1016/j.disc.2008.03.020zbMath1190.94025OpenAlexW2089161071MaRDI QIDQ1045033

Otokar Grošek, Peter Horák, Pavol Zajac

Publication date: 15 December 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2008.03.020

zbMATH Keywords

round functionblock ciphers design

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The structured design of cryptographically good s-boxes
• Minimal oriented graphs of diameter 2
• Communication Theory of Secrecy Systems*
• On Almost Perfect Nonlinear Permutations
• On perfect nonlinear functions

This page was built for publication: On complexity of round transformations