A survey of hard core functions
From MaRDI portal
Recommendations
- Moderately hard functions: definition, instantiations, and applications
- Advances in Cryptology – CRYPTO 2004
- Some Theorems Concerning the Core Function
- On some problems involving Hardy's function
- A Survey of Transcendentally Transcendental Functions
- Core Function Based Characterizations Of Number Theoretic Functions
- Exact functionals and their core
- A survey of Hardy type theorems
- Combinatorial properties of classes of functions hard to compute in constant depth
Cited in
(10)- Security of polynomial transformations of the Diffie-Hellman key.
- Security of most significant bits of \(g^{x^{2}}\).
- The security of all private-key bits in isogeny-based schemes
- Security of the most significant bits of the Shamir message passing scheme
- Finding significant Fourier coefficients: clarifications, simplifications, applications and limitations
- A primitive for proving the security of every bit and about universal hash functions \& hard core bits
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
- Advances in Cryptology – CRYPTO 2004
- On the bit security of elliptic curve Diffie-Hellman
- On the fine-grained complexity of parity problems
This page was built for publication: A survey of hard core functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2708625)
