Assessing privacy criteria for drm using eu privacy legislation. - Anja Becker 001; Alapan Arnab; Mercè Serra (Digital Rights Management Workshop, 2008)

Improved Generic Algorithms for Hard Knapsacks. - Anja Becker 001; Jean-Sébastien Coron; Antoine Joux (IACR Cryptol. ePrint Arch., 2011)

Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding. - Anja Becker 001; Antoine Joux; Alexander May 001; Alexander Meurer (EUROCRYPT, 2012)

Decoding Random Binary Linear Codes in 2n/20: How 1+1=0 Improves Information Set Decoding. - Anja Becker 001; Antoine Joux; Alexander May 001; Alexander Meurer (IACR Cryptol. ePrint Arch., 2012)

Solving shortest and closest vector problems: The decomposition approach. - Anja Becker 001; Nicolas Gama; Antoine Joux (IACR Cryptol. ePrint Arch., 2013)

A sieve algorithm based on overlattices. - Anja Becker 001; Nicolas Gama; Antoine Joux (LMS J. Comput. Math., 2014)

New directions in nearest neighbor searching with applications to lattice sieving. - Anja Becker 001; Léo Ducas; Nicolas Gama; Thijs Laarhoven (IACR Cryptol. ePrint Arch., 2015)

Speeding-up lattice sieving without increasing the memory, using sub-quadratic nearest neighbor search. - Anja Becker 001; Nicolas Gama; Antoine Joux (IACR Cryptol. ePrint Arch., 2015)

Efficient (ideal) lattice sieving using cross-polytope LSH. - Anja Becker 001; Thijs Laarhoven (IACR Cryptol. ePrint Arch., 2015)

Speeding up lattice sieve with Xeon Phi coprocessor. - Anja Becker 001; Dusan Kostic (IACR Cryptol. ePrint Arch., 2017)