![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Tanja Lange 0001
Person information
- affiliation: Technische Universiteit Eindhoven, NL
Other persons with the same name
- Tanja Lange 0002
— University of Lübeck, Germany
Refine list
![note](https://dblp.dagstuhl.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i85]Seongtaek Chee, Kyung Chul Jeong, Tanja Lange, Nari Lee, Alex Pellegrini, Hansol Ryu:
Analysis of Layered ROLLO-I. IACR Cryptol. ePrint Arch. 2024: 230 (2024) - [i84]Daniel J. Bernstein, Jolijn Cottaar, Tanja Lange:
Searching for differential addition chains. IACR Cryptol. ePrint Arch. 2024: 1044 (2024) - 2023
- [c67]Shi Bai
, Iggy van Hoof, Floyd Johnson, Tanja Lange, Tran Ngo
:
Concrete Analysis of Quantum Lattice Enumeration. ASIACRYPT (3) 2023: 131-166 - [c66]Gustavo Banegas, Juliane Krämer, Tanja Lange, Michael Meyer
, Lorenz Panny, Krijn Reijnders, Jana Sotáková
, Monika Trimoska:
Disorientation Faults in CSIDH. EUROCRYPT (5) 2023: 310-342 - [c65]Tanja Lange, Alex Pellegrini, Alberto Ravagnani:
On the security of REDOG. ICISC (2) 2023: 282-305 - [i83]Tanja Lange, Alex Pellegrini, Alberto Ravagnani:
On the security of REDOG. IACR Cryptol. ePrint Arch. 2023: 1205 (2023) - [i82]Shi Bai, Iggy van Hoof, Floyd Johnson, Tanja Lange, Tran Ngo:
Concrete Analysis of Quantum Lattice Enumeration. IACR Cryptol. ePrint Arch. 2023: 1623 (2023) - [i81]Jolijn Cottaar, Kathrin Hövelmanns, Andreas Hülsing, Tanja Lange, Mohammad Mahzoun, Alex Pellegrini, Alberto Ravagnani, Sven Schäge, Monika Trimoska, Benne de Weger:
Report on evaluation of KpqC candidates. IACR Cryptol. ePrint Arch. 2023: 1853 (2023) - 2022
- [i80]Gustavo Banegas, Juliane Krämer, Tanja Lange, Michael Meyer, Lorenz Panny, Krijn Reijnders, Jana Sotáková, Monika Trimoska:
Disorientation faults in CSIDH. IACR Cryptol. ePrint Arch. 2022: 1202 (2022) - 2021
- [j16]Gustavo Banegas
, Daniel J. Bernstein, Iggy van Hoof, Tanja Lange:
Concrete quantum cryptanalysis of binary elliptic curves. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2021(1): 451-472 (2021) - [j15]Gustavo Banegas, Daniel J. Bernstein, Fabio Campos
, Tung Chou, Tanja Lange, Michael Meyer
, Benjamin Smith
, Jana Sotáková
:
CTIDH: faster constant-time CSIDH. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2021(4): 351-387 (2021) - [c64]Ruben Gonzalez, Andreas Hülsing
, Matthias J. Kannwischer, Juliane Krämer, Tanja Lange, Marc Stöttinger, Elisabeth Waitz, Thom Wiggers
, Bo-Yin Yang:
Verifying Post-Quantum Signatures in 8 kB of RAM. PQCrypto 2021: 215-233 - [i79]Kai-Min Chung, Yao-Ching Hsieh, Mi-Ying Huang, Yu-Hsuan Huang, Tanja Lange, Bo-Yin Yang:
Group Signatures and Accountable Ring Signatures from Isogeny-based Assumptions. CoRR abs/2110.04795 (2021) - [i78]Gustavo Banegas, Daniel J. Bernstein, Fabio Campos, Tung Chou, Tanja Lange, Michael Meyer, Benjamin Smith, Jana Sotáková:
CTIDH: faster constant-time CSIDH. IACR Cryptol. ePrint Arch. 2021: 633 (2021) - [i77]Ruben Gonzalez, Andreas Hülsing, Matthias J. Kannwischer, Juliane Krämer, Tanja Lange, Marc Stöttinger, Elisabeth Waitz, Thom Wiggers, Bo-Yin Yang:
Verifying Post-Quantum Signatures in 8 kB of RAM. IACR Cryptol. ePrint Arch. 2021: 662 (2021) - [i76]Kai-Min Chung, Yao-Ching Hsieh, Mi-Ying Huang, Yu-Hsuan Huang, Tanja Lange, Bo-Yin Yang:
Group Signatures and Accountable Ring Signatures from Isogeny-based Assumptions. IACR Cryptol. ePrint Arch. 2021: 1368 (2021) - [i75]Daniel J. Bernstein, Tanja Lange:
Non-randomness of S-unit lattices. IACR Cryptol. ePrint Arch. 2021: 1428 (2021) - 2020
- [c63]Daniel J. Bernstein, Tanja Lange:
McTiny: Fast High-Confidence Post-Quantum Key Erasure for Tiny Network Servers. USENIX Security Symposium 2020: 1731-1748 - [i74]Gustavo Banegas, Daniel J. Bernstein, Iggy van Hoof, Tanja Lange:
Concrete quantum cryptanalysis of binary elliptic curves. IACR Cryptol. ePrint Arch. 2020: 1296 (2020)
2010 – 2019
- 2019
- [c62]Daniel J. Bernstein, Tanja Lange, Chloe Martindale, Lorenz Panny:
Quantum Circuits for the CSIDH: Optimizing Quantum Evaluation of Isogenies. EUROCRYPT (2) 2019: 409-441 - [e8]Tanja Lange, Orr Dunkelman:
Progress in Cryptology - LATINCRYPT 2017 - 5th International Conference on Cryptology and Information Security in Latin America, Havana, Cuba, September 20-22, 2017, Revised Selected Papers. Lecture Notes in Computer Science 11368, Springer 2019, ISBN 978-3-030-25282-3 [contents] - [i73]Daniel J. Bernstein, Tanja Lange:
McTiny: fast high-confidence post-quantum key erasure for tiny network servers. IACR Cryptol. ePrint Arch. 2019: 1395 (2019) - 2018
- [c61]Daniel J. Bernstein, Leon Groot Bruinderink, Tanja Lange, Lorenz Panny:
HILA5 Pindakaas: On the CCA Security of Lattice-Based Encryption with Error Correction. AFRICACRYPT 2018: 203-216 - [c60]Wouter Castryck
, Tanja Lange, Chloe Martindale, Lorenz Panny, Joost Renes:
CSIDH: An Efficient Post-Quantum Commutative Group Action. ASIACRYPT (3) 2018: 395-427 - [c59]Andreas Hülsing
, Tanja Lange, Kit Smeets:
Rounded Gaussians - Fast and Secure Constant-Time Sampling for Lattice-Based Crypto. Public Key Cryptography (2) 2018: 728-757 - [e7]Tanja Lange, Rainer Steinwandt:
Post-Quantum Cryptography - 9th International Conference, PQCrypto 2018, Fort Lauderdale, FL, USA, April 9-11, 2018, Proceedings. Lecture Notes in Computer Science 10786, Springer 2018, ISBN 978-3-319-79062-6 [contents] - [i72]Wouter Castryck, Tanja Lange, Chloe Martindale, Lorenz Panny, Joost Renes:
CSIDH: An Efficient Post-Quantum Commutative Group Action. IACR Cryptol. ePrint Arch. 2018: 383 (2018) - [i71]Daniel J. Bernstein, Tanja Lange, Chloe Martindale, Lorenz Panny:
Quantum circuits for the CSIDH: optimizing quantum evaluation of isogenies. IACR Cryptol. ePrint Arch. 2018: 1059 (2018) - 2017
- [j14]Daniel J. Bernstein, Tanja Lange:
Post-quantum cryptography. Nat. 549(7671): 188-194 (2017) - [c58]Daniel J. Bernstein, Joachim Breitner, Daniel Genkin, Leon Groot Bruinderink, Nadia Heninger, Tanja Lange, Christine van Vredendaal, Yuval Yarom
:
Sliding Right into Disaster: Left-to-Right Sliding Windows Leak. CHES 2017: 555-576 - [c57]Jens Bauch, Daniel J. Bernstein, Henry de Valence, Tanja Lange, Christine van Vredendaal:
Short Generators Without Quantum Computers: The Case of Multiquadratics. EUROCRYPT (1) 2017: 27-59 - [c56]Daniel J. Bernstein, Chitchanok Chuengsatiansup, Tanja Lange, Christine van Vredendaal:
NTRU Prime: Reducing Attack Surface at Low Cost. SAC 2017: 235-260 - [c55]Robin Kwant, Tanja Lange, Kimberley Thissen:
Lattice Klepto - Turning Post-Quantum Crypto Against Itself. SAC 2017: 336-354 - [e6]Tanja Lange, Tsuyoshi Takagi:
Post-Quantum Cryptography - 8th International Workshop, PQCrypto 2017, Utrecht, The Netherlands, June 26-28, 2017, Proceedings. Lecture Notes in Computer Science 10346, Springer 2017, ISBN 978-3-319-59878-9 [contents] - [i70]Daniel J. Bernstein, Chitchanok Chuengsatiansup, Tanja Lange:
Double-base scalar multiplication revisited. IACR Cryptol. ePrint Arch. 2017: 37 (2017) - [i69]Daniel J. Bernstein, Tanja Lange:
Montgomery curves and the Montgomery ladder. IACR Cryptol. ePrint Arch. 2017: 293 (2017) - [i68]Daniel J. Bernstein, Tanja Lange:
Post-quantum cryptography - dealing with the fallout of physics success. IACR Cryptol. ePrint Arch. 2017: 314 (2017) - [i67]Jens Bauch, Daniel J. Bernstein, Henry de Valence, Tanja Lange, Christine van Vredendaal:
Short generators without quantum computers: the case of multiquadratics. IACR Cryptol. ePrint Arch. 2017: 404 (2017) - [i66]Daniel J. Bernstein, Joachim Breitner, Daniel Genkin, Leon Groot Bruinderink, Nadia Heninger, Tanja Lange, Christine van Vredendaal, Yuval Yarom:
Sliding right into disaster: Left-to-right sliding windows leak. IACR Cryptol. ePrint Arch. 2017: 627 (2017) - [i65]Andreas Hülsing, Tanja Lange, Kit Smeets:
Rounded Gaussians - Fast and Secure Constant-Time Sampling for Lattice-Based Crypto. IACR Cryptol. ePrint Arch. 2017: 1025 (2017) - [i64]Robin Kwant, Tanja Lange, Kimberley Thissen:
Lattice Klepto: Turning Post-Quantum Crypto Against Itself. IACR Cryptol. ePrint Arch. 2017: 1140 (2017) - [i63]Daniel J. Bernstein, Leon Groot Bruinderink, Tanja Lange, Lorenz Panny:
HILA5 Pindakaas: On the CCA security of lattice-based encryption with error correction. IACR Cryptol. ePrint Arch. 2017: 1214 (2017) - 2016
- [c54]Daniel J. Bernstein, Tanja Lange, Ruben Niederhagen:
Dual EC: A Standardized Back Door. The New Codebreakers 2016: 256-281 - [c53]Leon Groot Bruinderink, Andreas Hülsing
, Tanja Lange, Yuval Yarom
:
Flush, Gauss, and Reload - A Cache Attack on the BLISS Lattice-Based Signature Scheme. CHES 2016: 323-345 - [i62]Leon Groot Bruinderink, Andreas Hülsing, Tanja Lange, Yuval Yarom:
Flush, Gauss, and Reload - A Cache Attack on the BLISS Lattice-Based Signature Scheme. IACR Cryptol. ePrint Arch. 2016: 300 (2016) - [i61]Daniel J. Bernstein, Susanne Engels, Tanja Lange, Ruben Niederhagen, Christof Paar, Peter Schwabe, Ralf Zimmermann:
Faster discrete logarithms on FPGAs. IACR Cryptol. ePrint Arch. 2016: 382 (2016) - [i60]Daniel J. Bernstein, Chitchanok Chuengsatiansup, Tanja Lange, Christine van Vredendaal:
NTRU Prime. IACR Cryptol. ePrint Arch. 2016: 461 (2016) - [i59]Sebastian R. Verschoor, Tanja Lange:
(In-)Secure messaging with the Silent Circle instant messaging protocol. IACR Cryptol. ePrint Arch. 2016: 703 (2016) - 2015
- [c52]Daniel J. Bernstein, Andreas Hülsing
, Tanja Lange, Ruben Niederhagen:
Bad Directions in Cryptographic Hash Functions. ACISP 2015: 488-508 - [c51]Daniel J. Bernstein, Daira Hopwood, Andreas Hülsing
, Tanja Lange, Ruben Niederhagen, Louiza Papachristodoulou, Michael Schneider, Peter Schwabe, Zooko Wilcox-O'Hearn:
SPHINCS: Practical Stateless Hash-Based Signatures. EUROCRYPT (1) 2015: 368-397 - [c50]Daniel J. Bernstein, Chitchanok Chuengsatiansup, David Kohel, Tanja Lange:
Twisted Hessian Curves. LATINCRYPT 2015: 269-294 - [c49]Daniel J. Bernstein, Tung Chou
, Chitchanok Chuengsatiansup, Andreas Hülsing
, Eran Lambooij, Tanja Lange, Ruben Niederhagen, Christine van Vredendaal:
How to Manipulate Curve Standards: A White Paper for the Black Hat http: //bada55.cr.yp.to. SSR 2015: 109-139 - [i58]Daniel J. Bernstein, Andreas Hülsing, Tanja Lange, Ruben Niederhagen:
Bad directions in cryptographic hash functions. IACR Cryptol. ePrint Arch. 2015: 151 (2015) - [i57]Daniel J. Bernstein, Tanja Lange, Christine van Vredendaal:
Tighter, faster, simpler side-channel security evaluations beyond computing power. IACR Cryptol. ePrint Arch. 2015: 221 (2015) - [i56]Daniel J. Bernstein, Simon Josefsson, Tanja Lange, Peter Schwabe, Bo-Yin Yang:
EdDSA for more curves. IACR Cryptol. ePrint Arch. 2015: 677 (2015) - [i55]Daniel J. Bernstein, Tanja Lange, Ruben Niederhagen:
Dual EC: A Standardized Back Door. IACR Cryptol. ePrint Arch. 2015: 767 (2015) - [i54]Daniel J. Bernstein, Chitchanok Chuengsatiansup, David Kohel, Tanja Lange:
Twisted Hessian curves. IACR Cryptol. ePrint Arch. 2015: 781 (2015) - 2014
- [j13]Daniel J. Bernstein, Tanja Lange:
Hyper-and-elliptic-curve cryptography. LMS J. Comput. Math. 17(Theory): 181-202 (2014) - [c48]Daniel J. Bernstein, Chitchanok Chuengsatiansup, Tanja Lange, Peter Schwabe:
Kummer Strikes Back: New DH Speed Records. ASIACRYPT (1) 2014: 317-337 - [c47]Tanja Lange, Christine van Vredendaal, Marnix Wakker:
Kangaroos in Side-Channel Attacks. CARDIS 2014: 104-121 - [c46]Daniel J. Bernstein, Chitchanok Chuengsatiansup, Tanja Lange:
Curve41417: Karatsuba Revisited. CHES 2014: 316-334 - [c45]Daniel J. Bernstein, Bernard van Gastel, Wesley Janssen, Tanja Lange, Peter Schwabe, Sjaak Smetsers:
TweetNaCl: A Crypto Library in 100 Tweets. LATINCRYPT 2014: 64-83 - [c44]Daniel J. Bernstein, Tanja Lange:
Batch NFS. Selected Areas in Cryptography 2014: 38-58 - [c43]Stephen Checkoway, Ruben Niederhagen, Adam Everspaugh, Matthew Green, Tanja Lange, Thomas Ristenpart, Daniel J. Bernstein, Jake Maskiewicz, Hovav Shacham, Matthew Fredrikson:
On the Practical Exploitability of Dual EC in TLS Implementations. USENIX Security Symposium 2014: 319-335 - [e5]Tanja Lange, Kristin E. Lauter, Petr Lisonek:
Selected Areas in Cryptography - SAC 2013 - 20th International Conference, Burnaby, BC, Canada, August 14-16, 2013, Revised Selected Papers. Lecture Notes in Computer Science 8282, Springer 2014, ISBN 978-3-662-43413-0 [contents] - [i53]Daniel J. Bernstein, Chitchanok Chuengsatiansup, Tanja Lange, Peter Schwabe:
Kummer strikes back: new DH speed records. IACR Cryptol. ePrint Arch. 2014: 134 (2014) - [i52]Daniel J. Bernstein, Tanja Lange:
Hyper-and-elliptic-curve cryptography. IACR Cryptol. ePrint Arch. 2014: 379 (2014) - [i51]Daniel J. Bernstein, Chitchanok Chuengsatiansup, Tanja Lange:
Curve41417: Karatsuba revisited. IACR Cryptol. ePrint Arch. 2014: 526 (2014) - [i50]Tanja Lange, Christine van Vredendaal, Marnix Wakker:
Kangaroos in Side-Channel Attacks. IACR Cryptol. ePrint Arch. 2014: 565 (2014) - [i49]Daniel J. Bernstein, Tung Chou, Chitchanok Chuengsatiansup, Andreas Hülsing, Tanja Lange, Ruben Niederhagen, Christine van Vredendaal:
How to manipulate curve standards: a white paper for the black hat. IACR Cryptol. ePrint Arch. 2014: 571 (2014) - [i48]Daniel J. Bernstein, Daira Hopwood, Andreas Hülsing, Tanja Lange, Ruben Niederhagen, Louiza Papachristodoulou, Peter Schwabe, Zooko Wilcox-O'Hearn:
SPHINCS: practical stateless hash-based signatures. IACR Cryptol. ePrint Arch. 2014: 795 (2014) - [i47]Daniel J. Bernstein, Tanja Lange:
Batch NFS. IACR Cryptol. ePrint Arch. 2014: 921 (2014) - 2013
- [j12]Daniel J. Bernstein, Peter Birkner, Tanja Lange, Christiane Peters:
ECM using Edwards curves. Math. Comput. 82(282): 1139-1179 (2013) - [c42]Daniel J. Bernstein, Tanja Lange:
Non-uniform Cracks in the Concrete: The Power of Free Precomputation. ASIACRYPT (2) 2013: 321-340 - [c41]Daniel J. Bernstein, Yun-An Chang, Chen-Mou Cheng, Li-Ping Chou, Nadia Heninger, Tanja Lange, Nicko van Someren:
Factoring RSA Keys from Certified Smart Cards: Coppersmith in the Wild. ASIACRYPT (2) 2013: 341-360 - [c40]W. Michael Petullo, Xu Zhang, Jon A. Solworth, Daniel J. Bernstein, Tanja Lange:
MinimaLT: minimal-latency networking through better security. CCS 2013: 425-438 - [c39]Daniel J. Bernstein, Mike Hamburg, Anna Krasnova, Tanja Lange:
Elligator: elliptic-curve points indistinguishable from uniform random strings. CCS 2013: 967-980 - [c38]Daniel J. Bernstein, Stacey Jeffery
, Tanja Lange, Alexander Meurer:
Quantum Algorithms for the Subset-Sum Problem. PQCrypto 2013: 16-33 - [p1]Daniel J. Bernstein, Tanja Lange:
Addition formulas for elliptic curves. Handbook of Finite Fields 2013: 440-446 - [e4]Michel Abdalla
, Tanja Lange:
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 [contents] - [i46]Daniel J. Bernstein, Stacey Jeffery, Tanja Lange, Alexander Meurer:
Quantum algorithms for the subset-sum problem. IACR Cryptol. ePrint Arch. 2013: 199 (2013) - [i45]W. Michael Petullo, Xu Zhang, Jon A. Solworth, Daniel J. Bernstein, Tanja Lange:
MinimaLT: Minimal-latency Networking Through Better Security. IACR Cryptol. ePrint Arch. 2013: 310 (2013) - [i44]Daniel J. Bernstein, Anna Krasnova, Tanja Lange:
Elligator: Elliptic-curve points indistinguishable from uniform random strings. IACR Cryptol. ePrint Arch. 2013: 325 (2013) - [i43]Daniel J. Bernstein, Yun-An Chang, Chen-Mou Cheng, Li-Ping Chou, Nadia Heninger, Tanja Lange, Nicko van Someren:
Factoring RSA keys from certified smart cards: Coppersmith in the wild. IACR Cryptol. ePrint Arch. 2013: 599 (2013) - 2012
- [j11]Daniel J. Bernstein, Niels Duif, Tanja Lange, Peter Schwabe, Bo-Yin Yang:
High-speed high-security signatures. J. Cryptogr. Eng. 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 Cryptol. ePrint Arch. 2012: 2 (2012) - [i41]Daniel J. Bernstein, Tanja Lange:
The new SHA-3 software shootout. IACR Cryptol. ePrint Arch. 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 Cryptol. ePrint Arch. 2012: 137 (2012) - [i39]Daniel J. Bernstein, Tanja Lange:
Two grumpy giants and a baby. IACR Cryptol. ePrint Arch. 2012: 294 (2012) - [i38]Daniel J. Bernstein, Tanja Lange:
Non-uniform cracks in the concrete: the power of free precomputation. IACR Cryptol. ePrint Arch. 2012: 318 (2012) - [i37]Daniel J. Bernstein, Tanja Lange:
Never trust a bunny. IACR Cryptol. ePrint Arch. 2012: 355 (2012) - [i36]Daniel J. Bernstein, Tanja Lange:
Computing small discrete logarithms faster. IACR Cryptol. ePrint Arch. 2012: 458 (2012) - [i35]Daniel J. Bernstein, Jeroen Doumen, Tanja Lange, Jan-Jaap Oosterwijk:
Faster batch forgery identification. IACR Cryptol. ePrint Arch. 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 - [r17]Tanja Lange:
Edwards Curves. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 380-382 - [r16]Tanja Lange:
Hash-Based Signatures. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 540-542 - [r15]Tanja Lange:
Pairing-Based Key Exchange. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 903-904 - [r14]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 Cryptol. ePrint Arch. 2011: 3 (2011) - [i33]Daniel J. Bernstein, Tanja Lange, Christiane Peters, Peter Schwabe:
Really fast syndrome-based hashing. IACR Cryptol. ePrint Arch. 2011: 74 (2011) - [i32]Daniel J. Bernstein, Tanja Lange, Christiane Peters, Peter Schwabe:
Faster 2-regular information-set decoding. IACR Cryptol. ePrint Arch. 2011: 120 (2011) - [i31]Daniel J. Bernstein, Niels Duif, Tanja Lange, Peter Schwabe, Bo-Yin Yang:
High-speed high-security signatures. IACR Cryptol. ePrint Arch. 2011: 368 (2011) - [i30]Daniel J. Bernstein, Tanja Lange, Christiane Peters:
Wild McEliece Incognito. IACR Cryptol. ePrint Arch. 2011: 502 (2011) - [i29]Daniel J. Bernstein, Tanja Lange, Peter Schwabe:
The security impact of a new cryptographic library. IACR Cryptol. ePrint Arch. 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 - [e3]Daniel J. Bernstein, Tanja Lange:
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 [contents] - [i28]Daniel J. Bernstein, Tanja Lange:
Type-II Optimal Polynomial Bases. IACR Cryptol. ePrint Arch. 2010: 69 (2010) - [i27]Daniel J. Bernstein, Peter Birkner, Tanja Lange:
Starfish on Strike. IACR Cryptol. ePrint Arch. 2010: 367 (2010) - [i26]Daniel J. Bernstein, Tanja Lange, Christiane Peters:
Wild McEliece. IACR Cryptol. ePrint Arch. 2010: 410 (2010) - [i25]Daniel J. Bernstein, Tanja Lange, Christiane Peters:
Smaller decoding exponents: ball-collision decoding. IACR Cryptol. ePrint Arch. 2010: 585 (2010) - [i24]Daniel J. Bernstein, Tanja Lange:
Cryptanalysis of Skein. IACR Cryptol. ePrint Arch. 2010: 623 (2010)
2000 – 2009
- 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 Cryptol. ePrint Arch. 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 Cryptol. ePrint Arch. 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 Cryptol. ePrint Arch. 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 Cryptol. ePrint Arch. 2009: 541 (2009) - [i19]Daniel J. Bernstein, Tanja Lange:
A complete set of addition laws for incomplete Edwards curves. IACR Cryptol. ePrint Arch. 2009: 580 (2009) - [i18]Craig Costello, Tanja Lange, Michael Naehrig:
Faster Pairing Computations on Curves with High-Degree Twists. IACR Cryptol. ePrint Arch. 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. Cryptol. 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 Cryptol. ePrint Arch. 2008: 13 (2008) - [i16]Daniel J. Bernstein, Peter Birkner, Tanja Lange, Christiane Peters:
ECM using Edwards curves. IACR Cryptol. ePrint Arch. 2008: 16 (2008) - [i15]Daniel J. Bernstein, Tanja Lange, Reza Rezaeian Farashahi:
Binary Edwards Curves. IACR Cryptol. ePrint Arch. 2008: 171 (2008) - [i14]Daniel J. Bernstein, Tanja Lange, Christiane Peters:
Attacking and defending the McEliece cryptosystem. IACR Cryptol. ePrint Arch. 2008: 318 (2008) - [i13]Daniel J. Bernstein, Tien-Ren Chen, Chen-Mou Cheng, Tanja Lange, Bo-Yin Yang:
ECM on Graphics Cards. IACR Cryptol. ePrint Arch. 2008: 480 (2008) - 2007
- [j9]Tanja Lange, Igor E. Shparlinski
:
Distribution of some sequences of points on elliptic curves. J. Math. Cryptol. 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 Cryptol. ePrint Arch. 2007: 286 (2007) - [i11]Daniel J. Bernstein, Tanja Lange:
Inverted Edwards coordinates. IACR Cryptol. ePrint Arch. 2007: 410 (2007) - [i10]Daniel J. Bernstein, Peter Birkner, Tanja Lange, Christiane Peters:
Optimizing double-base elliptic-curve single-scalar multiplication. IACR Cryptol. ePrint Arch. 2007: 414 (2007) - [i9]Daniel J. Bernstein, Tanja Lange:
Analysis and optimization of elliptic-curve single-scalar multiplication. IACR Cryptol. ePrint Arch. 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 - [e2]Rana Barua, Tanja Lange:
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 [contents] - [i8]Yvo Desmedt, Tanja Lange, Mike Burmester:
Scalable Authenticated Tree Based Group Key Exchange for Ad-Hoc Groups. IACR Cryptol. ePrint Arch. 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 E. 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 Their Appl. 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 - [e1]Henri Cohen, Gerhard Frey, Roberto Avanzi, Christophe Doche, Tanja Lange, Kim Nguyen, Frederik Vercauteren:
Handbook of Elliptic and Hyperelliptic Curve Cryptography. Chapman and Hall/CRC 2005, ISBN 978-1-58488-518-4 [contents] - [r13]Roberto Maria Avanzi, Tanja Lange:
Introduction to Public-Key Cryptography. Handbook of Elliptic and Hyperelliptic Curve Cryptography 2005: 1-15 - [r12]Gerhard Frey, Tanja Lange:
Background on Curves and Jacobians. Handbook of Elliptic and Hyperelliptic Curve Cryptography 2005: 45-85 - [r11]Gerhard Frey, Tanja Lange:
Varieties over Special Fields. Handbook of Elliptic and Hyperelliptic Curve Cryptography 2005: 87-113 - [r10]Gerhard Frey, Tanja Lange:
Background on Weil Descent. Handbook of Elliptic and Hyperelliptic Curve Cryptography 2005: 125-132 - [r9]Christophe Doche, Tanja Lange:
Arithmetic of Elliptic Curves. Handbook of Elliptic and Hyperelliptic Curve Cryptography 2005: 267-302 - [r8]Sylvain Duquesne, Tanja Lange:
Arithmetic of Hyperelliptic Curves. Handbook of Elliptic and Hyperelliptic Curve Cryptography 2005: 303-353 - [r7]Christophe Doche, Tanja Lange:
Arithmetic of Special Curves. Handbook of Elliptic and Hyperelliptic Curve Cryptography 2005: 355-387 - [r6]Gerhard Frey, Tanja Lange:
Complex Multiplication. Handbook of Elliptic and Hyperelliptic Curve Cryptography 2005: 455-473 - [r5]Gerhard Frey, Tanja Lange:
Transfer of Discrete Logarithms. Handbook of Elliptic and Hyperelliptic Curve Cryptography 2005: 529-545 - [r4]Gerhard Frey, Tanja Lange:
Algebraic Realizations of DL Systems. Handbook of Elliptic and Hyperelliptic Curve Cryptography 2005: 546-572 - [r3]Sylvain Duquesne, Tanja Lange:
Pairing-Based Cryptography. Handbook of Elliptic and Hyperelliptic Curve Cryptography 2005: 573-590 - [r2]Tanja Lange:
Mathematical Countermeasures against Side-Channel Attacks. Handbook of Elliptic and Hyperelliptic Curve Cryptography 2005: 687-714 - [r1]Tanja Lange, David Lubicz, Andrew Weigl:
Random Numbers Generation and Testing. Handbook of Elliptic and Hyperelliptic Curve Cryptography 2005: 715-735 - [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 Cryptol. ePrint Arch. 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 Cryptol. ePrint Arch. 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. Discret. Appl. Math. 128(1): 193-206 (2003) - [j3]Sergei Konyagin, Tanja Lange, Igor E. Shparlinski:
Linear Complexity of the Discrete Logarithm. Des. Codes Cryptogr. 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 Cryptol. ePrint Arch. 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 Cryptol. ePrint Arch. 2002: 107 (2002) - [i3]Tanja Lange:
Efficient Arithmetic on Genus 2 Hyperelliptic Curves over Finite Fields via Explicit Formulae. IACR Cryptol. ePrint Arch. 2002: 121 (2002) - [i2]Tanja Lange:
Inversion-Free Arithmetic on Genus 2 Hyperelliptic Curves. IACR Cryptol. ePrint Arch. 2002: 147 (2002) - [i1]Tanja Lange:
Weighted Coordinates on Genus 2 Hyperelliptic Curves. IACR Cryptol. ePrint Arch. 2002: 153 (2002) - 2001
- [j2]Tanja Lange, Arne Winterhof
:
Interpolation of the Discrete Logarithm in Finite Fields by Boolean Functions. Electron. Notes Discret. Math. 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
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint