Publications
Preprints
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
Information for reviewers
Review process
How to peer review
Peer review policy
Register Dashboard
Search

Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen

Register Dashboard
Search
87
views
22
references
 Top references
cited by
42
    
0 reviews
 Review
0
comments
 Comment
0
recommends
+1 Recommend
0 collections
    0
    shares
      3,720
      similar
       All similar
      • Record: found
      • Abstract: not found
      • Book Chapter: not found
      Automata, Languages and Programming 

      Generalized Compact Knapsacks Are Collision Resistant

      other
      Author(s): ,
      Publication date (Print):
      Publisher: Springer Berlin Heidelberg

      Read this book at

      Publisher
      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 references22

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

          NTRU: A ring-based public key cryptosystem

          Jeffrey Hoffstein, Jill Pipher, Joseph Silverman (1998)
          Article 0 comments Cited 150 times – based on 0 reviews
            Bookmark
            • Record: found
            • Abstract: not found
            • Article: not found

            A hierarchy of polynomial time lattice basis reduction algorithms

            C.P. Schnorr (1987)
            Article 0 comments Cited 105 times – based on 0 reviews     Review now
              Bookmark
              • Record: found
              • Abstract: not found
              • Conference Proceedings: not found

              Generating hard instances of lattice problems (extended abstract)

              M. Ajtai (1996)
              Article 0 comments Cited 100 times – based on 0 reviews
                Bookmark
                All references

                Author and book information

                Book Chapter
                Publication date (Print): 2006
                Pages: 144-155
                DOI: 10.1007/11787006_13
                SO-VID: bf620a4e-0ddf-4fee-82e4-c5f35e269acd
                History

                Data availability:

                Comments

                Comment on this book

                Book chapters

                Similar content3,720

                See all similar

                Cited by42

                See all cited by