First Page | Document Content | |
---|---|---|
Date: 2016-08-31 11:57:10Algebra Mathematics Cryptography Linear algebra Lattice-based cryptography Post-quantum cryptography Lattice points Computational hardness assumptions Lattice Euclidean vector Basis Crystal structure | Improved Reduction from the Bounded Distance Decoding Problem to the Unique Shortest Vector Problem in Lattices Shi Bai1 , Damien Stehl´e1 and Weiqiang Wen1 1Add to Reading ListSource URL: eprint.iacr.orgDownload Document from Source WebsiteFile Size: 471,84 KBShare Document on Facebook |
Polynomial Time Interactive Proofs for Linear Algebra with Exponential Matrix Dimensions and Scalars Given by Polynomial Time Circuits In memory of Wen-tsun Wu–Jean-Guillaume DumasDocID: 1xUE0 - View Document | |
1 Roadmap for the Development of a Linear Algebra Library for Exascale Computing SLATE: Software for Linear Algebra Targeting ExascaleDocID: 1xUyc - View Document | |
Recent Progress in Linear Algebra and Lattice Basis Reduction Gilles Villard CNRS, ENS de Lyon, INRIA, UCBL, Université de Lyon Laboratoire LIPDocID: 1xUmT - View Document | |
3 Designing SLATE SLATE: Software for Linear Algebra Targeting Exascale Jakub Kurzak Panruo WuDocID: 1xT5s - View Document | |
9. Linear Algebra Po-Shen Loh CMU Putnam Seminar, FallDocID: 1vrLR - View Document |