Tanja Lange

Technische Universiteit Eindhoven, NL

other persons with the same name:

• Tanja Lange 0002 - University of Lübeck, Germany

	2013
j12		Daniel J. Bernstein, Peter Birkner, Tanja Lange, Christiane Peters: ECM using Edwards curves. Math. Comput. 82(282) (2013)
e3		Michel Abdalla, Tanja Lange (Eds.): Pairing-Based Cryptography - Pairing 2012 - 5th International Conference, Cologne, Germany, May 16-18, 2012, Revised Selected Papers. Lecture Notes in Computer Science 7708, Springer 2013, isbn 978-3-642-36333-7
i43		Daniel J. Bernstein, Stacey Jeffery, Tanja Lange, Alexander Meurer: Quantum algorithms for the subset-sum problem. IACR Cryptology ePrint Archive 2013: 199 (2013)
	2012
j11		Daniel J. Bernstein, Niels Duif, Tanja Lange, Peter Schwabe, Bo-Yin Yang: High-speed high-security signatures. J. Cryptographic Engineering 2(2): 77-89 (2012)
c37		Daniel J. Bernstein, Tanja Lange: Computing Small Discrete Logarithms Faster. INDOCRYPT 2012: 317-338
c36		Daniel J. Bernstein, Jeroen Doumen, Tanja Lange, Jan-Jaap Oosterwijk: Faster Batch Forgery Identification. INDOCRYPT 2012: 454-473
c35		Daniel J. Bernstein, Tanja Lange, Peter Schwabe: The Security Impact of a New Cryptographic Library. LATINCRYPT 2012: 159-176
c34		Daniel J. Bernstein, Tanja Lange: Never Trust a Bunny. RFIDSec 2012: 137-148
i42		Daniel J. Bernstein, Hsieh-Chung Chen, Chen-Mou Cheng, Tanja Lange, Ruben Niederhagen, Peter Schwabe, Bo-Yin Yang: ECC2K-130 on NVIDIA GPUs. IACR Cryptology ePrint Archive 2012: 2 (2012)
i41		Daniel J. Bernstein, Tanja Lange: The new SHA-3 software shootout. IACR Cryptology ePrint Archive 2012: 4 (2012)
i40		Daniel J. Bernstein, Hsieh-Chung Chen, Chen-Mou Cheng, Tanja Lange, Ruben Niederhagen, Peter Schwabe, Bo-Yin Yang: Usable assembly language for GPUs: a success story. IACR Cryptology ePrint Archive 2012: 137 (2012)
i39		Daniel J. Bernstein, Tanja Lange: Two grumpy giants and a baby. IACR Cryptology ePrint Archive 2012: 294 (2012)
i38		Daniel J. Bernstein, Tanja Lange: Non-uniform cracks in the concrete: the power of free precomputation. IACR Cryptology ePrint Archive 2012: 318 (2012)
i37		Daniel J. Bernstein, Tanja Lange: Never trust a bunny. IACR Cryptology ePrint Archive 2012: 355 (2012)
i36		Daniel J. Bernstein, Tanja Lange: Computing small discrete logarithms faster. IACR Cryptology ePrint Archive 2012: 458 (2012)
i35		Daniel J. Bernstein, Jeroen Doumen, Tanja Lange, Jan-Jaap Oosterwijk: Faster batch forgery identification. IACR Cryptology ePrint Archive 2012: 549 (2012)
	2011
c33		Daniel J. Bernstein, Tanja Lange, Christiane Peters, Peter Schwabe: Really Fast Syndrome-Based Hashing. AFRICACRYPT 2011: 134-152
c32		Daniel J. Bernstein, Niels Duif, Tanja Lange, Peter Schwabe, Bo-Yin Yang: High-Speed High-Security Signatures. CHES 2011: 124-142
c31		Daniel J. Bernstein, Tanja Lange, Christiane Peters, Peter Schwabe: Faster 2-Regular Information-Set Decoding. IWCC 2011: 81-98
c30		Daniel J. Bernstein, Tanja Lange, Christiane Peters: Smaller Decoding Exponents: Ball-Collision Decoding. CRYPTO 2011: 743-760
c29		Tanja Lange: Elliptic Curves for Applications. INDOCRYPT 2011: 2
c28		Daniel J. Bernstein, Tanja Lange, Peter Schwabe: On the Correct Use of the Negation Map in the Pollard rho Method. Public Key Cryptography 2011: 128-146
c27		Daniel J. Bernstein, Tanja Lange, Christiane Peters: Wild McEliece Incognito. PQCrypto 2011: 244-254
r4		Tanja Lange: Edwards Curves. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 380-382
r3		Tanja Lange: Hash-Based Signatures. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 540-542
r2		Tanja Lange: Pairing-Based Key Exchange. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 903-904
r1		Tanja Lange: Vector Space. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 1356
i34		Daniel J. Bernstein, Tanja Lange, Peter Schwabe: On the correct use of the negation map in the Pollard rho method. IACR Cryptology ePrint Archive 2011: 3 (2011)
i33		Daniel J. Bernstein, Tanja Lange, Christiane Peters, Peter Schwabe: Really fast syndrome-based hashing. IACR Cryptology ePrint Archive 2011: 74 (2011)
i32		Daniel J. Bernstein, Tanja Lange, Christiane Peters, Peter Schwabe: Faster 2-regular information-set decoding. IACR Cryptology ePrint Archive 2011: 120 (2011)
i31		Daniel J. Bernstein, Niels Duif, Tanja Lange, Peter Schwabe, Bo-Yin Yang: High-speed high-security signatures. IACR Cryptology ePrint Archive 2011: 368 (2011)
i30		Daniel J. Bernstein, Tanja Lange, Christiane Peters: Wild McEliece Incognito. IACR Cryptology ePrint Archive 2011: 502 (2011)
i29		Daniel J. Bernstein, Tanja Lange, Peter Schwabe: The security impact of a new cryptographic library. IACR Cryptology ePrint Archive 2011: 646 (2011)
	2010
c26		Daniel J. Bernstein, Hsieh-Chung Chen, Chen-Mou Cheng, Tanja Lange, Ruben Niederhagen, Peter Schwabe, Bo-Yin Yang: ECC2K-130 on NVIDIA GPUs. INDOCRYPT 2010: 328-346
c25		Daniel J. Bernstein, Peter Birkner, Tanja Lange: Starfish on Strike. LATINCRYPT 2010: 61-80
c24		Craig Costello, Tanja Lange, Michael Naehrig: Faster Pairing Computations on Curves with High-Degree Twists. Public Key Cryptography 2010: 224-242
c23		Daniel J. Bernstein, Tanja Lange, Christiane Peters: Wild McEliece. Selected Areas in Cryptography 2010: 143-158
c22		Daniel J. Bernstein, Tanja Lange: Type-II Optimal Polynomial Bases. WAIFI 2010: 41-61
e2		Daniel J. Bernstein, Tanja Lange (Eds.): Progress in Cryptology - AFRICACRYPT 2010, Third International Conference on Cryptology in Africa, Stellenbosch, South Africa, May 3-6, 2010. Proceedings. Lecture Notes in Computer Science 6055, Springer 2010, isbn 978-3-642-12677-2
i28		Daniel J. Bernstein, Tanja Lange: Type-II Optimal Polynomial Bases. IACR Cryptology ePrint Archive 2010: 69 (2010)
i27		Daniel J. Bernstein, Peter Birkner, Tanja Lange: Starfish on Strike. IACR Cryptology ePrint Archive 2010: 367 (2010)
i26		Daniel J. Bernstein, Tanja Lange, Christiane Peters: Wild McEliece. IACR Cryptology ePrint Archive 2010: 410 (2010)
i25		Daniel J. Bernstein, Tanja Lange, Christiane Peters: Smaller decoding exponents: ball-collision decoding. IACR Cryptology ePrint Archive 2010: 585 (2010)
i24		Daniel J. Bernstein, Tanja Lange: Cryptanalysis of Skein. IACR Cryptology ePrint Archive 2010: 623 (2010)
	2009
c21		Daniel J. Bernstein, Tien-Ren Chen, Chen-Mou Cheng, Tanja Lange, Bo-Yin Yang: ECM on Graphics Cards. EUROCRYPT 2009: 483-501
c20		Daniel J. Bernstein, Tanja Lange, Ruben Niederhagen, Christiane Peters, Peter Schwabe: FSBday. INDOCRYPT 2009: 18-38
i23		Christophe Arene, Tanja Lange, Michael Naehrig, Christophe Ritzenthaler: Faster Computation of the Tate Pairing. IACR Cryptology ePrint Archive 2009: 155 (2009)
i22		Daniel J. Bernstein, Tanja Lange, Ruben Niederhagen, Christiane Peters, Peter Schwabe: Implementing Wagner's generalized birthday attack against the SHA-3 round-1 candidate FSB. IACR Cryptology ePrint Archive 2009: 292 (2009)
i21		Daniel V. Bailey, Brian Baldwin, Lejla Batina, Daniel J. Bernstein, Peter Birkner, Joppe W. Bos, Gauthier Van Damme, Giacomo de Meulenaer, Junfeng Fan, Tim Güneysu, Frank K. Gürkaynak, Thorsten Kleinjung, Tanja Lange, Nele Mentens, Christof Paar, Francesco Regazzoni, Peter Schwabe, Leif Uhsadel: The Certicom Challenges ECC2-X. IACR Cryptology ePrint Archive 2009: 466 (2009)
i20		Daniel V. Bailey, Lejla Batina, Daniel J. Bernstein, Peter Birkner, Joppe W. Bos, Hsieh-Chung Chen, Chen-Mou Cheng, Gauthier Van Damme, Giacomo de Meulenaer, Luis J. Dominguez Perez, Junfeng Fan, Tim Güneysu, Frank K. Gürkaynak, Thorsten Kleinjung, Tanja Lange, Nele Mentens, Ruben Niederhagen, Christof Paar, Francesco Regazzoni, Peter Schwabe, Leif Uhsadel, Anthony Van Herrewege, Bo-Yin Yang: Breaking ECC2K-130. IACR Cryptology ePrint Archive 2009: 541 (2009)
i19		Daniel J. Bernstein, Tanja Lange: A complete set of addition laws for incomplete Edwards curves. IACR Cryptology ePrint Archive 2009: 580 (2009)
i18		Craig Costello, Tanja Lange, Michael Naehrig: Faster Pairing Computations on Curves with High-Degree Twists. IACR Cryptology ePrint Archive 2009: 615 (2009)
	2008
j10		Michel Abdalla, Mihir Bellare, Dario Catalano, Eike Kiltz, Tadayoshi Kohno, Tanja Lange, John Malone-Lee, Gregory Neven, Pascal Paillier, Haixia Shi: Searchable Encryption Revisited: Consistency Properties, Relation to Anonymous IBE, and Extensions. J. Cryptology 21(3): 350-391 (2008)
c19		Daniel J. Bernstein, Peter Birkner, Marc Joye, Tanja Lange, Christiane Peters: Twisted Edwards Curves. AFRICACRYPT 2008: 389-405
c18		Daniel J. Bernstein, Tanja Lange, Reza Rezaeian Farashahi: Binary Edwards Curves. CHES 2008: 244-265
c17		Yvo Desmedt, Tanja Lange: Revisiting Pairing Based Group Key Exchange. Financial Cryptography 2008: 53-68
c16		Daniel J. Bernstein, Tanja Lange, Christiane Peters: Attacking and Defending the McEliece Cryptosystem. PQCrypto 2008: 31-46
i17		Daniel J. Bernstein, Peter Birkner, Marc Joye, Tanja Lange, Christiane Peters: Twisted Edwards Curves. IACR Cryptology ePrint Archive 2008: 13 (2008)
i16		Daniel J. Bernstein, Peter Birkner, Tanja Lange, Christiane Peters: ECM using Edwards curves. IACR Cryptology ePrint Archive 2008: 16 (2008)
i15		Daniel J. Bernstein, Tanja Lange, Reza Rezaeian Farashahi: Binary Edwards Curves. IACR Cryptology ePrint Archive 2008: 171 (2008)
i14		Daniel J. Bernstein, Tanja Lange, Christiane Peters: Attacking and defending the McEliece cryptosystem. IACR Cryptology ePrint Archive 2008: 318 (2008)
i13		Daniel J. Bernstein, Tien-Ren Chen, Chen-Mou Cheng, Tanja Lange, Bo-Yin Yang: ECM on Graphics Cards. IACR Cryptology ePrint Archive 2008: 480 (2008)
	2007
j9		Tanja Lange, Igor E. Shparlinski: Distribution of some sequences of points on elliptic curves. J. Mathematical Cryptology 1(1): 1-11 (2007)
c15		Daniel J. Bernstein, Tanja Lange: Inverted Edwards Coordinates. AAECC 2007: 20-27
c14		Daniel J. Bernstein, Tanja Lange: Faster Addition and Doubling on Elliptic Curves. ASIACRYPT 2007: 29-50
c13		Yvo Desmedt, Tanja Lange, Mike Burmester: Scalable Authenticated Tree Based Group Key Exchange for Ad-Hoc Groups. Financial Cryptography 2007: 104-118
c12		Daniel J. Bernstein, Peter Birkner, Tanja Lange, Christiane Peters: Optimizing Double-Base Elliptic-Curve Single-Scalar Multiplication. INDOCRYPT 2007: 167-182
i12		Daniel J. Bernstein, Tanja Lange: Faster addition and doubling on elliptic curves. IACR Cryptology ePrint Archive 2007: 286 (2007)
i11		Daniel J. Bernstein, Tanja Lange: Inverted Edwards coordinates. IACR Cryptology ePrint Archive 2007: 410 (2007)
i10		Daniel J. Bernstein, Peter Birkner, Tanja Lange, Christiane Peters: Optimizing double-base elliptic-curve single-scalar multiplication. IACR Cryptology ePrint Archive 2007: 414 (2007)
i9		Daniel J. Bernstein, Tanja Lange: Analysis and optimization of elliptic-curve single-scalar multiplication. IACR Cryptology ePrint Archive 2007: 455 (2007)
	2006
c11		Gerhard Frey, Tanja Lange: Fast Bilinear Maps from the Tate-Lichtenbaum Pairing on Hyperelliptic Curves. ANTS 2006: 466-479
c10		Yvo Desmedt, Tanja Lange: Pairing Based Threshold Cryptography Improving on Libert-Quisquater and Baek-Zheng. Financial Cryptography 2006: 154-159
e1		Rana Barua, Tanja Lange (Eds.): Progress in Cryptology - INDOCRYPT 2006, 7th International Conference on Cryptology in India, Kolkata, India, December 11-13, 2006, Proceedings. Lecture Notes in Computer Science 4329, Springer 2006, isbn 3-540-49767-6
i8		Yvo Desmedt, Tanja Lange, Mike Burmester: Scalable Authenticated Tree Based Group Key Exchange for Ad-Hoc Groups. IACR Cryptology ePrint Archive 2006: 443 (2006)
	2005
j8		Tanja Lange: Formulae for Arithmetic on Genus 2 Hyperelliptic Curves. Appl. Algebra Eng. Commun. Comput. 15(5): 295-328 (2005)
j7		Tanja Lange, Igor Shparlinski: Collisions in Fast Generation of Ideal Classes and Points on Hyperelliptic and Elliptic Curves. Appl. Algebra Eng. Commun. Comput. 15(5): 329-337 (2005)
j6		Tanja Lange: Koblitz curve cryptosystems. Finite Fields and Their Applications 11(2): 200-229 (2005)
c9		Michel Abdalla, Mihir Bellare, Dario Catalano, Eike Kiltz, Tadayoshi Kohno, Tanja Lange, John Malone-Lee, Gregory Neven, Pascal Paillier, Haixia Shi: Searchable Encryption Revisited: Consistency Properties, Relation to Anonymous IBE, and Extensions. CRYPTO 2005: 205-222
c8		Tanja Lange, Pradeep Kumar Mishra: SCA Resistant Parallel Explicit Formula for Addition and Doubling of Divisors in the Jacobian of Hyperelliptic Curves of Genus 2. INDOCRYPT 2005: 403-416
c7		Nina Brandstätter, Tanja Lange, Arne Winterhof: On the Non-linearity and Sparsity of Boolean Functions Related to the Discrete Logarithm in Finite Fields of Characteristic Two. WCC 2005: 135-143
i7		Michel Abdalla, Mihir Bellare, Dario Catalano, Eike Kiltz, Tadayoshi Kohno, Tanja Lange, John Malone-Lee, Gregory Neven, Pascal Paillier, Haixia Shi: Searchable Encryption Revisited: Consistency Properties, Relation to Anonymous IBE, and Extensions. IACR Cryptology ePrint Archive 2005: 254 (2005)
	2004
j5		Roberto Maria Avanzi, Gerhard Frey, Tanja Lange, Roger Oyono: On using expansions to the base of -2. Int. J. Comput. Math. 81(4): 403-406 (2004)
c6		Tanja Lange: Montgomery Addition for Genus Two Curves. ANTS 2004: 309-317
c5		Tanja Lange, Marc Stevens: Efficient Doubling on Genus Two Curves over Binary Fields. Selected Areas in Cryptography 2004: 170-181
i6		Tanja Lange: A note on López-Dahab coordinates. IACR Cryptology ePrint Archive 2004: 323 (2004)
	2003
j4		Tanja Lange, Arne Winterhof: Interpolation of the Discrete Logarithm in Fq by Boolean Functions and by Polynomials in Several Variables Modulo a Divisor of Q-1. Discrete Applied Mathematics 128(1): 193-206 (2003)
j3		Sergei Konyagin, Tanja Lange, Igor Shparlinski: Linear Complexity of the Discrete Logarithm. Des. Codes Cryptography 28(2): 135-146 (2003)
c4		Tanja Lange, Arne Winterhof: Interpolation of the Elliptic Curve Diffie-Hellman Mapping. AAECC 2003: 51-60
c3		Mathieu Ciet, Tanja Lange, Francesco Sica, Jean-Jacques Quisquater: Improved Algorithms for Efficient Arithmetic on Elliptic Curves Using Fast Endomorphisms. EUROCRYPT 2003: 388-400
i5		Tanja Lange: Trace Zero Subvariety for Cryptosystems. IACR Cryptology ePrint Archive 2003: 94 (2003)
	2002
c2		Tanja Lange, Arne Winterhof: Polynomial Interpolation of the Elliptic Curve and XTR Discrete Logarithm. COCOON 2002: 137-143
i4		Tanja Lange: Efficient Arithmetic on Hyperelliptic Curves. IACR Cryptology ePrint Archive 2002: 107 (2002)
i3		Tanja Lange: Efficient Arithmetic on Genus 2 Hyperelliptic Curves over Finite Fields via Explicit Formulae. IACR Cryptology ePrint Archive 2002: 121 (2002)
i2		Tanja Lange: Inversion-Free Arithmetic on Genus 2 Hyperelliptic Curves. IACR Cryptology ePrint Archive 2002: 147 (2002)
i1		Tanja Lange: Weighted Coordinates on Genus 2 Hyperelliptic Curves. IACR Cryptology ePrint Archive 2002: 153 (2002)
	2001
j2		Tanja Lange, Arne Winterhof: Interpolation of the Discrete Logarithm in Finite Fields by Boolean Functions. Electronic Notes in Discrete Mathematics 6: 498-506 (2001)
	2000
j1		Tanja Lange, Arne Winterhof: Factoring polynomials over arbitrary finite fields. Theor. Comput. Sci. 234(1-2): 301-308 (2000)
c1		Christian Günther, Tanja Lange, Andreas Stein: Speeding up the Arithmetic on Koblitz Curves of Genus Two. Selected Areas in Cryptography 2000: 106-117

Coauthor Index

Colors in the list of coauthors

Last update Tue May 21 14:25:31 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page