On the relationship between resilient Boolean functions and linear branch number of S-boxes

DOI10.1007/978-3-030-35423-7_18zbMath1456.94110OpenAlexW2994061451MaRDI QIDQ2179400

Kalikinkar Mandal, Sumanta Sarkar, Dhiman Saha

Publication date: 12 May 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-35423-7_18

zbMATH Keywords

nonlinearitydifferential uniformityS-boxdifferential branch numberlinear branch numberlightweight cipherresilient Boolean function

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (1)

RAMus- a new lightweight block cipher for RAM encryption

Cites Work

• Bounds on differential and linear branch number of permutations
• The SKINNY Family of Block Ciphers and Its Low-Latency Variant MANTIS
• Cryptographic Analysis of All 4 × 4-Bit S-Boxes
• The 128-Bit Blockcipher CLEFIA (Extended Abstract)
• PRESENT: An Ultra-Lightweight Block Cipher
• Communication Theory of Secrecy Systems*
• GIFT: A Small Present
• Maximal recursive sequences with 3-valued recursive cross-correlation functions (Corresp.)
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the relationship between resilient Boolean functions and linear branch number of S-boxes