Transparency order of (n, m)-functions -- its further characterization and applications
From MaRDI portal
Publication:2154041
Recommendations
- On characterization of transparency order for \((n, m)\)-functions
- Transparency order for Boolean functions: analysis and construction
- Nontransitive representations of transitive orderings
- scientific article; zbMATH DE number 880639
- scientific article; zbMATH DE number 2097074
- Transversals of total strict linear orders
- On the rank of generalized order-preserving transformation semigroups
- scientific article; zbMATH DE number 5066509
- The characterization of orders for regular functions
- On transfinite Knuth-Bendix orders
Cites work
- \texttt{Midori}: a block cipher for low energy
- A statistical model for DPA with novel algorithmic confusion analysis
- Block ciphers -- focus on the linear layer (feat. PRIDE)
- Cryptographic Hardware and Embedded Systems - CHES 2004
- Differential Power Analysis of Stream Ciphers
- Fast Software Encryption
- GIFT: a small present. Towards reaching the limit of lightweight encryption
- scientific article; zbMATH DE number 1682693 (Why is no real title available?)
- scientific article; zbMATH DE number 1418307 (Why is no real title available?)
- LBlock: a lightweight block cipher
- On ``bent functions
- Piccolo: An Ultra-Lightweight Blockcipher
- PRESENT: An Ultra-Lightweight Block Cipher
- PRINCE -- a low-latency block cipher for pervasive computing applications. Extended abstract
- Provable security against a differential attack
- Redefining the transparency order
- Spectral approach for correlation power analysis
- The SKINNY Family of Block Ciphers and Its Low-Latency Variant MANTIS
- Topics in Cryptology – CT-RSA 2006
- Transparency order for Boolean functions: analysis and construction
Cited in
(7)- A note on the signal-to-noise ratio of \((n, m)\)-functions
- On characterization of transparency order for \((n, m)\)-functions
- Transparency order for Boolean functions: analysis and construction
- Redefining the transparency order
- On Highly Nonlinear S-Boxes and Their Inability to Thwart DPA Attacks
- Fast Software Encryption
- Characterizing the upper bound on the transparency order of (n, m)-functions
This page was built for publication: Transparency order of \((n, m)\)-functions -- its further characterization and applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2154041)