Alexander Meurer
IACR Cryptology ePrint Archive · 2012
A researcher in the Science corpus: 1 paper; trusts 1 researcher and is trusted by 0 researchers here, as inferred from the citation graph.
Whom Alexander Meurer trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
Papers from Alexander Meurer's perspective
Ordered by how strongly the researchers Alexander Meurer trusts endorse each paper. Same corpus, a different order for every researcher.
- Secure Human Identification Protocols (International Conference on the Theory and Application of Cryptology and Information Security)
- A Generalized Birthday Problem (Annual International Cryptology Conference)
- On lattices, learning with errors, random linear codes, and cryptography
- More on Average Case vs Approximation Complexity (44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings.)
- Attacking and defending the McEliece cryptosystem (IACR Cryptology ePrint Archive)
- Noise-tolerant learning, the parity problem, and the statistical query model (Symposium on the Theory of Computing)
- A personal communication
- Theoretical Use of Cache Memory as a Cryptanalytic Side-Channel (IACR Cryptology ePrint Archive)
- Random oracles are practical: a paradigm for designing efficient protocols
- An overview of JML tools and applications (International Journal on Software Tools for Technology Transfer (STTT))
Their papers
- Decoding Random Binary Linear Codes in 2n/20: How 1+1=0 Improves Information Set Decoding (2012) — 441 citations