On self-equivalence encodings in white-box implementations
From MaRDI portal
Publication:832398
DOI10.1007/978-3-030-81652-0_25zbMath1493.94042OpenAlexW3185456757MaRDI QIDQ832398
Publication date: 25 March 2022
Full work available at URL: https://lirias.kuleuven.be/handle/123456789/671564
Related Items (2)
Implicit white-box implementations: white-boxing ARX ciphers ⋮ A white-box speck implementation using self-equivalence encodings
Uses Software
Cites Work
- On enumeration of polynomial equivalence classes and their application to MPKC
- A DFA attack on white-box implementations of AES with external encodings
- An improved affine equivalence algorithm for random permutations
- Differential computation analysis: hiding your white-box designs is not enough
- An efficient affine equivalence algorithm for multiple S-boxes and a structured affine layer
- Cryptographic Schemes Based on the ASASA Structure: Black-Box, White-Box, and Public-Key (Extended Abstract)
- Two Attacks on a White-Box AES Implementation
- Algorithm 898
- A White-Box DES Implementation for DRM Applications
- Attacking an Obfuscated Cipher by Injecting Faults
- Protecting White-Box AES with Dual Ciphers
- Cryptanalysis of the Xiao – Lai White-Box AES Implementation
- Polynomial Equivalence Problems: Algorithmic and Theoretical Aspects
- Cryptanalysis of a Generic Class of White-Box Implementations
- Cryptanalysis of White-Box DES Implementations with Arbitrary External Encodings
- Cryptanalysis of White Box DES Implementations
- Selected Areas in Cryptography
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On self-equivalence encodings in white-box implementations
