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
32
views
16
references
 Top references
cited by
18
    
0 reviews
 Review
0
comments
 Comment
0
recommends
+1 Recommend
0 collections
    0
    shares
      3,786
      similar
       All similar
      • Record: found
      • Abstract: not found
      • Book Chapter: not found
      Selected Areas in Cryptography 

      Compact McEliece Keys from Goppa Codes

      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 references16

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

          On the inherent intractability of certain coding problems (Corresp.)

          E. Berlekamp, R. McEliece, H. van Tilborg (1978)
          Article 0 comments Cited 208 times – based on 0 reviews     Review now
            Bookmark
            • Record: found
            • Abstract: not found
            • Article: not found

            Finding the permutation between equivalent linear codes: the support splitting algorithm

            N. Sendrier (2000)
            Article 0 comments Cited 37 times – based on 0 reviews     Review now
              Bookmark
              • Record: found
              • Abstract: not found
              • Article: not found

              Generalized Compact Knapsacks, Cyclic Lattices, and Efficient One-Way Functions

              Daniele Micciancio (2007)
              Article 0 comments Cited 37 times – based on 0 reviews     Review now
                Bookmark
                All references

                Author and book information

                Book Chapter
                Publication date (Print): 2009
                Pages: 376-392
                DOI: 10.1007/978-3-642-05445-7_24
                SO-VID: b4e1c787-d2d6-4d0f-ac00-e9f46d24f088
                History

                Data availability:

                Comments

                Comment on this book

                Book chapters

                Similar content3,786

                See all similar

                Cited by18

                See all cited by