Tanja Lange - Concepedia

Author

Tanja Lange

Also Known As

LATINCRYPT 2017 Havanna, Lange, T Tanja, Lange, Tanja, PQCrypto 2018 Fort Lauderdale, Fla., Takagi, Tsuyoshi, Tanja Lange

222

Publications

9.4K

Citations

H-Index

Concepts

All Affiliations

Eindhoven University of Technology University of Illinois Chicago Ruhr University Bochum Center for Discrete Mathematics and Theoretical Computer Science Macquarie University

About

Tanja Lange is an author at Eindhoven University of Technology specializing in engineering, computer science, and cryptography.

Top Concepts

#	Concept	H-Index	Publications	Citations
1	Engineering	16	17	1.5K
2	Computer Science	14	14	1.5K
3	Computer Engineering	6	6	691
4	Natural Sciences	2	2	62
5	Communication	1	1	50

Tanja Lange

Publications

3.6K

Citations

H-Index

Page 1

	Year	Citations
Post-quantum cryptography Daniel J. Bernstein, Tanja Lange Nature	2017	1.1K
High-speed high-security signatures Daniel J. Bernstein, Niels Duif, Tanja Lange, Journal of Cryptographic Engineering Cryptographic PrimitiveEngineeringInformation SecurityComputer ArchitectureInformation Forensics	2012	505
Searchable Encryption Revisited: Consistency Properties, Relation to Anonymous IBE, and Extensions Michel Abdalla⋆, Mihir Bellare, Dario Catalano, Journal of Cryptology Cryptographic PrimitiveEngineeringSearchable EncryptionInformation SecurityCryptographic Protection	2007	347
Elligator Daniel J. Bernstein, Mike Hamburg, Anna Krasnova, Internet SecurityCensorship-circumvention ToolsEngineeringInformation SecurityElliptic-curve Cryptography	2013	156
Twisted Edwards curves Daniel J. Bernstein, Peter Birkner, Marc Jóye, TU/e Research Portal (Eindhoven University of Technology)	2008	152
Formulae for Arithmetic on Genus 2 Hyperelliptic Curves Tanja Lange Applicable Algebra in Engineering Communication and Computing Diophantine AnalysisEnumerative GeometryComputational Number TheoryHyperelliptic Curves	2004	133
23rd USENIX Security Symposium Phil Lapsley, Daniel J. Bernstein, Matt Blaze, EngineeringSecurity ManagementUsable SecurityInformation SecuritySecurity Testing	2014	129
On the practical exploitability of dual EC in TLS implementations Stephen Checkoway, Matt Fredrikson, Ruben Niederhagen, TU/e Research Portal	2014	100
Faster computation of the Tate pairing Christophe Arène, Tanja Lange, Michael Naehrig, Journal of Number Theory Computational Number TheoryParticle PhysicsNon-perturbative QcdTate PairingApplied Algebra	2010	72
Elligator : elliptic-curve points indistinguishable from uniform random strings Daniel J. Bernstein, Mike Hamburg, Anna Krasnova, Radboud Repository (Radboud University)	2013	66

Page 1