Richard Lindner

IEEE Trans. Inf. Theory, 2013

2011

Towards efficient lattice-based cryptography.

[BibT_eX]

[DOI]

PhD thesis, 2011

Monoidic Codes in Cryptography.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2011

Decoding square-free Goppa codes over $\F_p$

[BibT_eX]

[DOI]

CoRR, 2011

A lattice-based batch identification scheme.

[BibT_eX]

[DOI]

Rosemberg Silva

Pierre-Louis Cayrel

Proceedings of the 2011 IEEE Information Theory Workshop, 2011

2010

Better Key Sizes (and Attacks) for LWE-Based Encryption.

[BibT_eX]

[DOI]

Chris Peikert

IACR Cryptol. ePrint Arch., 2010

Decoding square-free Goppa codes over F<sub>p</sub>.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2010

Improved Zero-Knowledge Identification with Lattices.

[BibT_eX]

[DOI]

Proceedings of the Provable Security - 4th International Conference, 2010

A Lattice-Based Threshold Ring Signature Scheme.

[BibT_eX]

[DOI]

Proceedings of the Progress in Cryptology, 2010

2009

Post-quantum cryptography: lattice signatures.

[BibT_eX]

[DOI]

Computing, 2009

Density of Ideal Lattices.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Number Theory, 24.05. - 29.05.2009, 2009

2008

Explicit hard instances of the shortest vector problem.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2008

Secure Parameters for SWIFFT.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2008

Efficiency Improvement for NTRU.

[BibT_eX]

[DOI]

Martin Döring

Proceedings of the Sicherheit 2008: Sicherheit, 2008

Explicit Hard Instances of the Shortest Vector Problem.

[BibT_eX]

[DOI]

Markus Rückert

Proceedings of the Post-Quantum Cryptography, Second International Workshop, 2008

2007

Identifying Ideal Lattices.

[BibT_eX]

[DOI]

Jintai Ding