Searching for authors named "Vadim Lyubashevsky" – sorted by Relevance.
-
The parity problem in the presence of noise, decoding random linear codes, and the subset sum problem
- Problem ⋆ (Extended Abstract) Vadim Lyubashevsky University of California at San Diego, La Jolla CA 92093
- Cited by 5 (1 self) – Add To MetaCart
-
Lattice-Based Identification Schemes Secure Under Active Attacks ⋆
- Lattice-Based Identification Schemes Secure Under Active Attacks ⋆ Vadim Lyubashevsky University
- Cited by 2 (1 self) – Add To MetaCart
-
Generalized compact knapsacks are collision resistant
- Generalized Compact Knapsacks are Collision Resistant * Vadim Lyubashevsky Daniele Micciancio
- Cited by 9 (6 self) – Add To MetaCart
-
Asymptotically Efficient Lattice-Based Digital Signatures ⋆
- Asymptotically Efficient Lattice-Based Digital Signatures ⋆ Vadim Lyubashevsky and Daniele
- Cited by 1 (1 self) – Add To MetaCart
-
Provably secure FFT hashing
- Provably Secure FFT Hashing Vadim Lyubashevsky ∗ Daniele Micciancio † Chris Peikert ‡ Alon Rosen
- Cited by 2 (2 self) – Add To MetaCart
-
SWIFFT: A Modest Proposal for FFT Hashing ⋆
- SWIFFT: A Modest Proposal for FFT Hashing ⋆ Vadim Lyubashevsky 1 , Daniele Micciancio 1 , Chris
- Cited by 2 (2 self) – Add To MetaCart
-
SWIFFTX: A Proposal for the SHA-3 Standard
- SWIFFTX: A Proposal for the SHA-3 Standard Yuriy Arbitman Gil Dogon ∗ Vadim Lyubashevsky † Daniele
- Add To MetaCart

