On self-equivalence encodings in white-box implementations
From MaRDI portal
Publication:832398
DOI10.1007/978-3-030-81652-0_25zbMATH Open1493.94042OpenAlexW3185456757MaRDI QIDQ832398FDOQ832398
Authors: Bart Preneel, Adrián H. Ranea 
Publication date: 25 March 2022
Full work available at URL: https://lirias.kuleuven.be/handle/123456789/671564
Recommendations
Cites Work
- Algorithm 898
- On enumeration of polynomial equivalence classes and their application to MPKC
- Title not available (Why is that?)
- Title not available (Why is that?)
- An improved affine equivalence algorithm for random permutations
- Title not available (Why is that?)
- Polynomial Equivalence Problems: Algorithmic and Theoretical Aspects
- A DFA attack on white-box implementations of AES with external encodings
- 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
- 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
- Cryptanalysis of a Generic Class of White-Box Implementations
- Title not available (Why is that?)
- Cryptanalysis of White-Box DES Implementations with Arbitrary External Encodings
- Cryptanalysis of White Box DES Implementations
- Selected Areas in Cryptography
Cited In (3)
Uses Software
This page was built for publication: On self-equivalence encodings in white-box implementations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q832398)
