scientific article; zbMATH DE number 1303132

zbMATH Open0919.94015MaRDI QIDQ4249648FDOQ4249648

Authors: Alain P. Hiltgen 

Publication date: 17 June 1999

Title of this publication is not available (Why is that?)

Recommendations

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

zbMATH Keywords

cryptographyinvertible linear Boolean functionsone-wayness of linear permutations

Mathematics Subject Classification ID

Cryptography (94A60) Boolean functions (06E30)

Cited In (5)

• 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 \times 4\)-bit s-boxes
• Algebraic cryptography: new constructions and their security against provable break
• Circuit complexity of linear functions: gate elimination and feeble security
• Feebly secure cryptographic primitives

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)