scientific article; zbMATH DE number 1303132

MaRDI QIDQ4249648zbMATH OpenFDO

Authors Alain P. Hiltgen

Publication date 17 June 1999

zbMATH Keywords

cryptographyinvertible linear Boolean functionsone-wayness of linear permutations

Mathematics Subject Classification ID

Boolean functions (06E30) Cryptography (94A60)

Recommendations

• One-way functions and circuit complexity
• scientific article; zbMATH DE number 1024027
• scientific article; zbMATH DE number 4125016
• One-way permutations in NC 0
• scientific article; zbMATH DE number 3990863

Cited in

(6)

• Feebly secure cryptographic primitives
• Circuit complexity of linear functions: gate elimination and feeble security
• Being a permutation is also orthogonal to one-wayness in quantum world: impossibilities of quantum one-way permutations from one-wayness primitives
• Cryptographic analysis of all 4 4-bit s-boxes
• Algebraic cryptography: new constructions and their security against provable break
• scientific article; zbMATH DE number 1024027 (Why is no real title available?)

This page was built for publication:

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