Tanja Lange

According to our database1, Tanja Lange authored at least 120 papers between 2000 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
McTiny: fast high-confidence post-quantum key erasure for tiny network servers.
IACR Cryptol. ePrint Arch., 2019

2018
CSIDH: An Efficient Post-Quantum Commutative Group Action.
IACR Cryptol. ePrint Arch., 2018

Quantum circuits for the CSIDH: optimizing quantum evaluation of isogenies.
IACR Cryptol. ePrint Arch., 2018

2017
Post-quantum cryptography.
Nat., 2017

Lattice Klepto: Turning Post-Quantum Crypto Against Itself.
IACR Cryptol. ePrint Arch., 2017

Rounded Gaussians - Fast and Secure Constant-Time Sampling for Lattice-Based Crypto.
IACR Cryptol. ePrint Arch., 2017

Post-quantum cryptography - dealing with the fallout of physics success.
IACR Cryptol. ePrint Arch., 2017

Montgomery curves and the Montgomery ladder.
IACR Cryptol. ePrint Arch., 2017

Double-base scalar multiplication revisited.
IACR Cryptol. ePrint Arch., 2017

Sliding right into disaster: Left-to-right sliding windows leak.
IACR Cryptol. ePrint Arch., 2017

HILA5 Pindakaas: On the CCA security of lattice-based encryption with error correction.
IACR Cryptol. ePrint Arch., 2017

Short generators without quantum computers: the case of multiquadratics.
IACR Cryptol. ePrint Arch., 2017

NTRU Prime: Reducing Attack Surface at Low Cost.
Proceedings of the Selected Areas in Cryptography - SAC 2017, 2017

2016
(In-)Secure messaging with the Silent Circle instant messaging protocol.
IACR Cryptol. ePrint Arch., 2016

Flush, Gauss, and Reload - A Cache Attack on the BLISS Lattice-Based Signature Scheme.
IACR Cryptol. ePrint Arch., 2016

Faster discrete logarithms on FPGAs.
IACR Cryptol. ePrint Arch., 2016

NTRU Prime.
IACR Cryptol. ePrint Arch., 2016

2015
Tighter, faster, simpler side-channel security evaluations beyond computing power.
IACR Cryptol. ePrint Arch., 2015

Dual EC: A Standardized Back Door.
IACR Cryptol. ePrint Arch., 2015

EdDSA for more curves.
IACR Cryptol. ePrint Arch., 2015

Bad directions in cryptographic hash functions.
IACR Cryptol. ePrint Arch., 2015

Twisted Hessian curves.
IACR Cryptol. ePrint Arch., 2015

How to Manipulate Curve Standards: A White Paper for the Black Hat http: //bada55.cr.yp.to.
Proceedings of the Security Standardisation Research - Second International Conference, 2015

SPHINCS: Practical Stateless Hash-Based Signatures.
Proceedings of the Advances in Cryptology - EUROCRYPT 2015, 2015

2014
Kangaroos in Side-Channel Attacks.
IACR Cryptol. ePrint Arch., 2014

Batch NFS.
IACR Cryptol. ePrint Arch., 2014

Hyper-and-elliptic-curve cryptography.
IACR Cryptol. ePrint Arch., 2014

SPHINCS: practical stateless hash-based signatures.
IACR Cryptol. ePrint Arch., 2014

Kummer strikes back: new DH speed records.
IACR Cryptol. ePrint Arch., 2014

Curve41417: Karatsuba revisited.
IACR Cryptol. ePrint Arch., 2014

How to manipulate curve standards: a white paper for the black hat.
IACR Cryptol. ePrint Arch., 2014

On the Practical Exploitability of Dual EC in TLS Implementations.
Proceedings of the 23rd USENIX Security Symposium, San Diego, CA, USA, August 20-22, 2014., 2014

TweetNaCl: A Crypto Library in 100 Tweets.
Proceedings of the Progress in Cryptology - LATINCRYPT 2014, 2014

2013
ECM using Edwards curves.
Math. Comput., 2013

MinimaLT: Minimal-latency Networking Through Better Security.
IACR Cryptol. ePrint Arch., 2013

Elligator: Elliptic-curve points indistinguishable from uniform random strings.
IACR Cryptol. ePrint Arch., 2013

Quantum algorithms for the subset-sum problem.
IACR Cryptol. ePrint Arch., 2013

Factoring RSA keys from certified smart cards: Coppersmith in the wild.
IACR Cryptol. ePrint Arch., 2013

Elligator: elliptic-curve points indistinguishable from uniform random strings.
Proceedings of the 2013 ACM SIGSAC Conference on Computer and Communications Security, 2013

Addition formulas for elliptic curves.
Proceedings of the Handbook of Finite Fields., 2013

2012
High-speed high-security signatures.
J. Cryptogr. Eng., 2012

Computing small discrete logarithms faster.
IACR Cryptol. ePrint Arch., 2012

Never trust a bunny.
IACR Cryptol. ePrint Arch., 2012

Non-uniform cracks in the concrete: the power of free precomputation.
IACR Cryptol. ePrint Arch., 2012

Two grumpy giants and a baby.
IACR Cryptol. ePrint Arch., 2012

The new SHA-3 software shootout.
IACR Cryptol. ePrint Arch., 2012

Faster batch forgery identification.
IACR Cryptol. ePrint Arch., 2012

Usable assembly language for GPUs: a success story.
IACR Cryptol. ePrint Arch., 2012

ECC2K-130 on NVIDIA GPUs.
IACR Cryptol. ePrint Arch., 2012

2011
Vector Space.
Proceedings of the Encyclopedia of Cryptography and Security, 2nd Ed., 2011

Pairing-Based Key Exchange.
Proceedings of the Encyclopedia of Cryptography and Security, 2nd Ed., 2011

Hash-Based Signatures.
Proceedings of the Encyclopedia of Cryptography and Security, 2nd Ed., 2011

Edwards Curves.
Proceedings of the Encyclopedia of Cryptography and Security, 2nd Ed., 2011

The security impact of a new cryptographic library.
IACR Cryptol. ePrint Arch., 2011

On the correct use of the negation map in the Pollard rho method.
IACR Cryptol. ePrint Arch., 2011

Faster 2-regular information-set decoding.
IACR Cryptol. ePrint Arch., 2011

Really fast syndrome-based hashing.
IACR Cryptol. ePrint Arch., 2011

Wild McEliece Incognito.
IACR Cryptol. ePrint Arch., 2011

Elliptic Curves for Applications.
Proceedings of the Progress in Cryptology - INDOCRYPT 2011, 2011

2010
Smaller decoding exponents: ball-collision decoding.
IACR Cryptol. ePrint Arch., 2010

Wild McEliece.
IACR Cryptol. ePrint Arch., 2010

Cryptanalysis of Skein.
IACR Cryptol. ePrint Arch., 2010

Type-II Optimal Polynomial Bases.
IACR Cryptol. ePrint Arch., 2010

Starfish on Strike.
IACR Cryptol. ePrint Arch., 2010

2009
Faster Pairing Computations on Curves with High-Degree Twists.
IACR Cryptol. ePrint Arch., 2009

Implementing Wagner's generalized birthday attack against the SHA-3 round-1 candidate FSB.
IACR Cryptol. ePrint Arch., 2009

A complete set of addition laws for incomplete Edwards curves.
IACR Cryptol. ePrint Arch., 2009

Breaking ECC2K-130.
IACR Cryptol. ePrint Arch., 2009

The Certicom Challenges ECC2-X.
IACR Cryptol. ePrint Arch., 2009

Faster Computation of the Tate Pairing.
IACR Cryptol. ePrint Arch., 2009

FSBday.
Proceedings of the Progress in Cryptology, 2009

2008
Searchable Encryption Revisited: Consistency Properties, Relation to Anonymous IBE, and Extensions.
J. Cryptology, 2008

Attacking and defending the McEliece cryptosystem.
IACR Cryptol. ePrint Arch., 2008

Binary Edwards Curves.
IACR Cryptol. ePrint Arch., 2008

ECM on Graphics Cards.
IACR Cryptol. ePrint Arch., 2008

Twisted Edwards Curves.
IACR Cryptol. ePrint Arch., 2008

Revisiting Pairing Based Group Key Exchange.
Proceedings of the Financial Cryptography and Data Security, 12th International Conference, 2008

2007
Distribution of some sequences of points on elliptic curves.
J. Mathematical Cryptology, 2007

Analysis and optimization of elliptic-curve single-scalar multiplication.
IACR Cryptol. ePrint Arch., 2007

Inverted Edwards coordinates.
IACR Cryptol. ePrint Arch., 2007

Faster addition and doubling on elliptic curves.
IACR Cryptol. ePrint Arch., 2007

Optimizing double-base elliptic-curve single-scalar multiplication.
IACR Cryptol. ePrint Arch., 2007

2006
Scalable Authenticated Tree Based Group Key Exchange for Ad-Hoc Groups.
IACR Cryptol. ePrint Arch., 2006

Pairing Based Threshold Cryptography Improving on Libert-Quisquater and Baek-Zheng.
Proceedings of the Financial Cryptography and Data Security, 2006

Fast Bilinear Maps from the Tate-Lichtenbaum Pairing on Hyperelliptic Curves.
Proceedings of the Algorithmic Number Theory, 7th International Symposium, 2006

2005
Random Numbers Generation and Testing.
Proceedings of the Handbook of Elliptic and Hyperelliptic Curve Cryptography., 2005

Mathematical Countermeasures against Side-Channel Attacks.
Proceedings of the Handbook of Elliptic and Hyperelliptic Curve Cryptography., 2005

Algebraic Realizations of DL Systems.
Proceedings of the Handbook of Elliptic and Hyperelliptic Curve Cryptography., 2005

Transfer of Discrete Logarithms.
Proceedings of the Handbook of Elliptic and Hyperelliptic Curve Cryptography., 2005

Complex Multiplication.
Proceedings of the Handbook of Elliptic and Hyperelliptic Curve Cryptography., 2005

Background on Weil Descent.
Proceedings of the Handbook of Elliptic and Hyperelliptic Curve Cryptography., 2005

Varieties over Special Fields.
Proceedings of the Handbook of Elliptic and Hyperelliptic Curve Cryptography., 2005

Background on Curves and Jacobians.
Proceedings of the Handbook of Elliptic and Hyperelliptic Curve Cryptography., 2005

Pairing-Based Cryptography.
Proceedings of the Handbook of Elliptic and Hyperelliptic Curve Cryptography., 2005

Arithmetic of Hyperelliptic Curves.
Proceedings of the Handbook of Elliptic and Hyperelliptic Curve Cryptography., 2005

Arithmetic of Special Curves.
Proceedings of the Handbook of Elliptic and Hyperelliptic Curve Cryptography., 2005

Arithmetic of Elliptic Curves.
Proceedings of the Handbook of Elliptic and Hyperelliptic Curve Cryptography., 2005

Introduction to Public-Key Cryptography.
Proceedings of the Handbook of Elliptic and Hyperelliptic Curve Cryptography., 2005

Koblitz curve cryptosystems.
Finite Fields Their Appl., 2005

Collisions in Fast Generation of Ideal Classes and Points on Hyperelliptic and Elliptic Curves.
Appl. Algebra Eng. Commun. Comput., 2005

Formulae for Arithmetic on Genus 2 Hyperelliptic Curves.
Appl. Algebra Eng. Commun. Comput., 2005

On the Non-linearity and Sparsity of Boolean Functions Related to the Discrete Logarithm in Finite Fields of Characteristic Two.
Proceedings of the Coding and Cryptography, International Workshop, 2005

SCA Resistant Parallel Explicit Formula for Addition and Doubling of Divisors in the Jacobian of Hyperelliptic Curves of Genus 2.
Proceedings of the Progress in Cryptology, 2005

2004
On using expansions to the base of -2.
Int. J. Comput. Math., 2004

A note on López-Dahab coordinates.
IACR Cryptol. ePrint Arch., 2004

Efficient Doubling on Genus Two Curves over Binary Fields.
Proceedings of the Selected Areas in Cryptography, 11th International Workshop, 2004

Montgomery Addition for Genus Two Curves.
Proceedings of the Algorithmic Number Theory, 6th International Symposium, 2004

2003
Trace Zero Subvariety for Cryptosystems.
IACR Cryptol. ePrint Arch., 2003

Linear Complexity of the Discrete Logarithm.
Des. Codes Cryptogr., 2003

Interpolation of the Discrete Logarithm in F<sub>q</sub> by Boolean Functions and by Polynomials in Several Variables Modulo a Divisor of Q-1.
Discret. Appl. Math., 2003

Improved Algorithms for Efficient Arithmetic on Elliptic Curves Using Fast Endomorphisms.
Proceedings of the Advances in Cryptology, 2003

Interpolation of the Elliptic Curve Diffie-Hellman Mapping.
Proceedings of the Applied Algebra, 2003

2002
Weighted Coordinates on Genus 2 Hyperelliptic Curves.
IACR Cryptol. ePrint Arch., 2002

Inversion-Free Arithmetic on Genus 2 Hyperelliptic Curves.
IACR Cryptol. ePrint Arch., 2002

Efficient Arithmetic on Genus 2 Hyperelliptic Curves over Finite Fields via Explicit Formulae.
IACR Cryptol. ePrint Arch., 2002

Efficient Arithmetic on Hyperelliptic Curves.
IACR Cryptol. ePrint Arch., 2002

Polynomial Interpolation of the Elliptic Curve and XTR Discrete Logarithm.
Proceedings of the Computing and Combinatorics, 8th Annual International Conference, 2002

2001
Interpolation of the Discrete Logarithm in Finite Fields by Boolean Functions.
Electron. Notes Discret. Math., 2001

2000
Factoring polynomials over arbitrary finite fields.
Theor. Comput. Sci., 2000

Speeding up the Arithmetic on Koblitz Curves of Genus Two.
Proceedings of the Selected Areas in Cryptography, 7th Annual International Workshop, 2000


  Loading...