scientific article; zbMATH DE number 7007915

DOI10.4086/cjtcs.2018.006zbMath1472.94051arXiv1607.01842OpenAlexW4237007951MaRDI QIDQ4615809

Barak Shani, Joel Laity, Steven D. Galbraith

Publication date: 29 January 2019

Published in: Chicago Journal of Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1607.01842

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

complete algorithmfunctions on finite abelian groupsignificant Fourier coefficients

Mathematics Subject Classification ID

Cryptography (94A60) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Related Items (2)

The security of all private-key bits in isogeny-based schemes ⋮ Solving the learning parity with noise problem using quantum algorithms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Absolutely convergent Fourier series. An improvement of the Beurling-Helson theorem
• On the modular inversion hidden number problem
• A quantitative version of the Beurling-Helson theorem
• Modern cryptography, probabilistic proofs and pseudo-randomness
• On sets of large Fourier transform under changes in domain
• The insecurity of the digital signature algorithm with partially known nonces
• Hard-Core Predicates for a Diffie-Hellman Problem over Finite Fields
• Pseudorandom Functions and Lattices
• Hardness of Computing Individual Bits for One-Way Functions on Elliptic Curves
• GLV/GLS Decomposition, Power Analysis, and Attacks on ECDSA Signatures with Single-Bit Nonce Bias
• The Multivariate Hidden Number Problem
• Solving Hidden Number Problem with One Bit Oracle and Advice
• RSA and Rabin Functions: Certain Parts are as Hard as the Whole
• Learning Decision Trees Using the Fourier Spectrum
• Sparse polynomial approximation in finite fields
• Randomized interpolation and approximation of sparse polynomials stPreliminary version
• A hidden number problem in small subgroups
• Classical hardness of learning with errors
• On lattices, learning with errors, random linear codes, and cryptography
• Public Key Cryptography – PKC 2004

This page was built for publication: