Sieving for Shortest Vectors in Ideal Lattices – ScienceOpen
5
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: not found
      • Book Chapter: not found
      Graph-Theoretic Concepts in Computer Science : 24th International Workshop, WG’98, Smolenice Castle, Slovak Republic, June 18-20, 1998. Proceedings 

      Sieving for Shortest Vectors in Ideal Lattices

      other
      Springer Berlin Heidelberg

      Read this book at

      Buy book Bookmark
          There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.

          Related collections

          Most cited references23

          • Record: found
          • Abstract: not found
          • Conference Proceedings: not found

          Fully homomorphic encryption using ideal lattices

            Bookmark
            • Record: found
            • Abstract: not found
            • Book Chapter: not found

            NTRU: A ring-based public key cryptosystem

              Bookmark
              • Record: found
              • Abstract: not found
              • Article: not found

              Factoring polynomials with rational coefficients

                Bookmark

                Author and book information

                Book Chapter
                2013
                : 375-391
                10.1007/978-3-642-38553-7_22
                ae9f4733-eb44-4559-84e4-d733cc80dea6
                History

                Comments

                Comment on this book

                Book chapters

                Similar content3,469

                Cited by4