Carl Löndahl

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Qian Guo 0001

> Home > Persons > Carl Löndahl

Publications

2020
[j5]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/joc/GuoJL20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/joc/GuoJL20
Qian Guo, Thomas Johansson, Carl Löndahl:
Solving LPN Using Covering Codes. J. Cryptol. 33(1): 1-33 (2020)
2015
[j3]
- view
  authority control:
- export record
  dblp key:
  - journals/tit/GuoJL15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tit/GuoJL15
Qian Guo, Thomas Johansson, Carl Löndahl:
A New Algorithm for Solving Ring-LPN With a Reducible Polynomial. IEEE Trans. Inf. Theory 61(11): 6204-6212 (2015)
2014
[c3]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - conf/asiacrypt/GuoJL14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/asiacrypt/GuoJL14
Qian Guo, Thomas Johansson, Carl Löndahl:
Solving LPN Using Covering Codes. ASIACRYPT (1) 2014: 1-20
[i1]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/GuoJL14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/GuoJL14
Qian Guo, Thomas Johansson, Carl Löndahl:
A New Algorithm for Solving Ring-LPN with a Reducible Polynomial. CoRR abs/1409.0472 (2014)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.