On Negation Complexity of Injections, Surjections and Collision-Resistance in Cryptography

DOI10.1007/978-3-319-49890-4_19zbMath1411.94077OpenAlexW2555190460MaRDI QIDQ3179494

No author found.

Publication date: 21 December 2016

Published in: Progress in Cryptology – INDOCRYPT 2016 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-49890-4_19

zbMATH Keywords

one-way functionssurjectionsinjectionscollision-resistant hash-functionsmonotone Boolean circuits

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Limiting negations in non-deterministic circuits
• The gap between monotone and non-monotone circuit complexity is exponential
• Limiting negations in bounded-depth circuits: an extension of Markov's theorem
• On the Inversion Complexity of a System of Functions
• Monotone Circuits for Connectivity Require Super-Logarithmic Depth
• Efficient balanced codes
• Limiting Negations in Constant Depth Circuits
• On the Complexity of Negation-Limited Boolean Networks
• The Power of Negations in Cryptography
• Learning circuits with few negations
• A Superpolynomial Lower Bound for a Circuit Computing the Clique Function with at most (1/6)log log n Negation Gates

This page was built for publication: On Negation Complexity of Injections, Surjections and Collision-Resistance in Cryptography