A linear equivalence algorithm

MaRDI QIDQ5445485zbMATH OpenFDO

Authors Marcin Serweciński

Publication date 5 March 2008

zbMATH Keywords

Boolean functionscryptologylinear equivalence

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• scientific article; zbMATH DE number 5242716
• scientific article; zbMATH DE number 2009947
• About linear and affine equivalence of substitutions
• An improved affine equivalence algorithm for random permutations
• Linear redundancy in S-boxes.

Cited in

(9)

• An improved affine equivalence algorithm for random permutations
• Affine equivalence in the AES round function
• On verification of restricted extended affine equivalence of vectorial Boolean functions
• Verification of restricted EA-equivalence for vectorial Boolean functions
• Analyzing the influence of linear redundancy in S-boxes on the affine equivalence within XSL-like round functions
• scientific article; zbMATH DE number 2009947 (Why is no real title available?)
• About linear and affine equivalence of substitutions
• Linear redundancy in S-boxes.
• Equality detection for linear arithmetic constraints

This page was built for publication: A linear equivalence algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5445485)