Rainer Steinwandt

Affiliations:
  • University of Alabama in Huntsville, USA
  • Florida Atlantic University, Boca Raton, FL, USA (former)
  • Karlsruhe Institute of Technology, Germany (former, PhD 2000)


According to our database1, Rainer Steinwandt authored at least 124 papers between 1999 and 2021.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
Quantum Cryptanalysis (Dagstuhl Seminar 21421).
Dagstuhl Reports, 2021

2020
Building Group Key Establishment on Group Theory: A Modular Approach.
Symmetry, 2020

Group Key Establishment in a Quantum-Future Scenario.
Informatica, 2020

2019
Algebraic Properties of the Block Cipher DESL.
Symmetry, 2019

Reducing the Cost of Implementing AES as a Quantum Circuit.
IACR Cryptol. ePrint Arch., 2019

Integrating Classical Preprocessing into an Optical Encryption Scheme.
Entropy, 2019

From Key Encapsulation to Authenticated Group Key Establishment - A Compiler for Post-Quantum Primitives †.
Entropy, 2019

Quantum Cryptanalysis (Dagstuhl Seminar 19421).
Dagstuhl Reports, 2019

Password-Authenticated Group Key Establishment from Smooth Projective Hash Functions.
Int. J. Appl. Math. Comput. Sci., 2019

2018
Extending Glitch-Free Multiparty Protocols to Resist Fault Injection Attacks.
IACR Trans. Cryptogr. Hardw. Embed. Syst., 2018

Cryptanalysis of a Proposal Based on the Discrete Logarithm Problem Inside <i>S<sub>n</sub></i>.
Cryptogr., 2018

2017
Extending Glitch-Free Multiparty Protocols to Resist Fault Injection Attacks.
IACR Cryptol. ePrint Arch., 2017

Quantum Cryptanalysis (Dagstuhl Seminar 17401).
Dagstuhl Reports, 2017

Private set intersection: New generic constructions and feasibility results.
Adv. Math. Commun., 2017

2016
Horizontal and Vertical Side Channel Analysis of a McEliece Cryptosystem.
IEEE Trans. Inf. Forensics Secur., 2016

Combined schemes for signature and encryption: The public-key and the identity-based setting.
Inf. Comput., 2016

Cryptanalysis of a modern rotor machine in a multicast setting.
Cryptologia, 2016

Applying Grover's Algorithm to AES: Quantum Resource Estimates.
Proceedings of the Post-Quantum Cryptography - 7th International Workshop, 2016

2015
Quantum circuits for 𝔽<sub>2<sup>n</sup></sub>-multiplication with subquadratic gate count.
Quantum Inf. Process., 2015

Automatic synthesis of quantum circuits for point addition on ordinary binary elliptic curves.
Quantum Inf. Process., 2015

A note on quantum related-key attacks.
Inf. Process. Lett., 2015

On the security margin of MAC striping.
Inf. Process. Lett., 2015

Masking Large Keys in Hardware: A Masked Implementation of McEliece.
IACR Cryptol. ePrint Arch., 2015

Quantum Cryptanalysis (Dagstuhl Seminar 15371).
Dagstuhl Reports, 2015

Group Theoretic Cryptography.
Chapman and Hall / CRC cryptography and network security series, CRC Press, ISBN: 978-1-584-88836-9, 2015

2014
A quantum circuit to find discrete logarithms on ordinary binary elliptic curves in depth O(log^2n).
Quantum Inf. Comput., 2014

Tuning a two-round group key agreement.
Int. J. Inf. Sec., 2014

Differential Power Analysis of a McEliece Cryptosystem.
IACR Cryptol. ePrint Arch., 2014

Scalable attribute-based group key establishment: from passive to active and deniable.
Appl. Algebra Eng. Commun. Comput., 2014

Narrow Bandwidth Is Not Inherent in Reverse Public-Key Encryption.
Proceedings of the Security and Cryptography for Networks - 9th International Conference, 2014

2013
On using probabilistic Turing machines to model participants in cryptographic protocols.
Theor. Comput. Sci., 2013

Efficient quantum circuits for binary elliptic curve arithmetic: reducing T-gate complexity.
Quantum Inf. Comput., 2013

Quantum binary field inversion: improved circuit depth via choice of basis representation.
Quantum Inf. Comput., 2013

Quantum Cryptanalysis (Dagstuhl Seminar 13371).
Dagstuhl Reports, 2013

A quantum circuit to find discrete logarithms on binary elliptic curves in depth O(log^2 n).
CoRR, 2013

2012
Multi-authority attribute-based encryption with honest-but-curious central authority.
Int. J. Comput. Math., 2012

Scalable Deniable Group Key Establishment.
IACR Cryptol. ePrint Arch., 2012

Identity-based non-interactive key distribution with forward security.
Des. Codes Cryptogr., 2012

Security of message authentication codes in the presence of key-dependent messages.
Des. Codes Cryptogr., 2012

Group Key Establishment: Adding Perfect Forward Secrecy at the Cost of One Round.
Proceedings of the Cryptology and Network Security, 11th International Conference, 2012

2011
Cryptanalysis of the Tillich-Zémor Hash Function.
J. Cryptol., 2011

Hardware architectures for algebra, cryptology, and number theory.
Integr., 2011

Quantum Cryptanalysis (Dagstuhl Seminar 11381).
Dagstuhl Reports, 2011

Cryptanalysis of a 2-party key establishment based on a semigroup action problem.
Adv. Math. Commun., 2011

Communication-Efficient 2-Round Group Key Establishment from Pairings.
Proceedings of the Topics in Cryptology - CT-RSA 2011, 2011

2010
PET SNAKE: A Special Purpose Architecture to Implement an Algebraic Attack in Hardware.
Trans. Comput. Sci., 2010

Special issue dedicated to Spyros Magliveras on the occasion of his 70th birthday.
Des. Codes Cryptogr., 2010

Attribute-based group key establishment.
Adv. Math. Commun., 2010

A ciphertext-only attack on Polly Two.
Appl. Algebra Eng. Commun. Comput., 2010

Server-assisted Long-term Secure 3-party Key Establishment.
Proceedings of the SECRYPT 2010, 2010

2009
Cryptanalysis of an authentication scheme using truncated polynomials.
Inf. Process. Lett., 2009

Cryptanalysis of a Message Recognition Protocol by Mashatan and Stinson.
IACR Cryptol. ePrint Arch., 2009

Reverse Public Key Encryption.
Proceedings of the BIOSIG 2009, 2009

2008
A one-time signature using run-length encoding.
Inf. Process. Lett., 2008

Combined (identity-based) public key schemes.
IACR Cryptol. ePrint Arch., 2008

Applications of algebra to cryptography.
Discret. Appl. Math., 2008

08491 Executive Summary - Theoretical Foundations of Practical Information Security.
Proceedings of the Theoretical Foundations of Practical Information Security, 30.11., 2008

08491 Abstracts Collection - Theoretical Foundations of Practical Information Security.
Proceedings of the Theoretical Foundations of Practical Information Security, 30.11., 2008

2007
Secure group key establishment revisited.
Int. J. Inf. Sec., 2007

Special-Purpose Hardware in Cryptanalysis: The Case of 1, 024-Bit RSA.
IEEE Secur. Priv., 2007

Cryptanalysis of a Hash Function Proposed at ICISC 2006.
IACR Cryptol. ePrint Arch., 2007

(Password) Authenticated Key Establishment: From 2-Party to Group.
Proceedings of the Theory of Cryptography, 4th Theory of Cryptography Conference, 2007

2006
Computing restrictions of ideals in finitely generated <i>k</i>-algebras by means of Buchberger's algorithm.
J. Symb. Comput., 2006

Entwurf asymmetrischer kryptographischer Verfahren unter Berücksichtigung von Quantenalgorithmen (Design of Asymmetric Cryptographic Schemes Taking Into Account Quantum Algorithms).
it Inf. Technol., 2006

Key substitution attacks revisited: Taking into account malicious signers.
Int. J. Inf. Sec., 2006

Non-Wafer-Scale Sieving Hardware for the NFS: Another Attempt to Cope with 1024-bit.
IACR Cryptol. ePrint Arch., 2006

A Simpler Sieving Device: Combining ECM and TWIRL.
IACR Cryptol. ePrint Arch., 2006

Password-Authenticated Constant-Round Group Key Establishment with a Common Reference String.
IACR Cryptol. ePrint Arch., 2006

Towards Provably Secure Group Key Agreement Building on Group Theory.
IACR Cryptol. ePrint Arch., 2006

Pitfalls in public key cryptosystems based on free partially commutative monoids and groups.
Appl. Math. Lett., 2006

Mathematical Techniques in Cryptology-Editorial.
Appl. Algebra Eng. Commun. Comput., 2006

Deniable Group Key Agreement.
Proceedings of the Progressin Cryptology, 2006

A Subliminal-Free Variant of ECDSA.
Proceedings of the Information Hiding, 8th International Workshop, 2006

An Algebra for Enterprise Privacy Policies Closed Under Composition and Conjunction.
Proceedings of the Emerging Trends in Information and Communication Security, 2006

2005
Cryptanalysis of a practical quantum key distribution with polarization-entangled photons.
Quantum Inf. Comput., 2005

A Practical Attack on the Root Problem in Braid Groups.
IACR Cryptol. ePrint Arch., 2005

Burmester-Desmedt Tree-Based Key Transport Revisited: Provable Security.
IACR Cryptol. ePrint Arch., 2005

Weak Keys in <i>MST</i><sub>1</sub>.
Des. Codes Cryptogr., 2005

A New Cramer-Shoup Like Methodology for Group Based Provably Secure Encryption Schemes.
Proceedings of the Theory of Cryptography, Second Theory of Cryptography Conference, 2005

Improved Routing-Based Linear Algebra for the Number Field Sieve.
Proceedings of the International Symposium on Information Technology: Coding and Computing (ITCC 2005), 2005

Scalable Hardware for Sparse Systems of Linear Equations, with Applications to Integer Factorization.
Proceedings of the Cryptographic Hardware and Embedded Systems - CHES 2005, 7th International Workshop, Edinburgh, UK, August 29, 2005

2004
Power attacks on a side-channel resistant elliptic curve implementation.
Inf. Process. Lett., 2004

On the Security and Composability of the One Time Pad.
IACR Cryptol. ePrint Arch., 2004

Towards a Uniform Description of Several Group Based Cryptographic Primitives.
Des. Codes Cryptogr., 2004

On the Security of Two Public Key Cryptosystems Using Non-Abelian Groups.
Des. Codes Cryptogr., 2004

A Reaction Attack on a Public Key Cryptosystem Based on the Word Problem.
Appl. Algebra Eng. Commun. Comput., 2004

On Subliminal Channels in Deterministic Signature Schemes.
Proceedings of the Information Security and Cryptology, 2004

An Algebra for Composing Enterprise Privacy Policies.
Proceedings of the Computer Security, 2004

2003
A Redundant Representation of GF(q^n) for Designing Arithmetic Circuits.
IEEE Trans. Computers, 2003

On the problem of authentication in a quantum protocol to detect traffic analysis.
Quantum Inf. Comput., 2003

An attack on the isomorphisms of polynomials problem with one secret.
Int. J. Inf. Sec., 2003

Initiator-Resilient Universally Composable Key Exchange.
IACR Cryptol. ePrint Arch., 2003

On Modeling IND-CCA Security in Cryptographic Protocols.
IACR Cryptol. ePrint Arch., 2003

A Key Substitution Attack on SFLASH<sup>v3</sup>.
IACR Cryptol. ePrint Arch., 2003

Attacks on a Secure Group Communication Scheme With Hierarchical Access Control.
IACR Cryptol. ePrint Arch., 2003

A short comment on the affine parts of SFLASH<sup>v3</sup>.
IACR Cryptol. ePrint Arch., 2003

Yet Another Sieving Device.
IACR Cryptol. ePrint Arch., 2003

On Minimal Length Factorizations of Finite Groups.
Exp. Math., 2003

A Practical Attack on Some Braid Group Based Cryptographic Primitives.
Proceedings of the Public Key Cryptography, 2003

A Dedicated Sieving Hardware.
Proceedings of the Public Key Cryptography, 2003

On the security of cryptographic primitives regarding technological innovations.
Proceedings of the 33. Jahrestagung der Gesellschaft für Informatik, Innovative Informatikanwendungen, INFORMATIK 2003, Frankfurt am Main, Germany, September 29, 2003

Hardware to Solve Sparse Systems of Linear Equations over GF(2).
Proceedings of the Cryptographic Hardware and Embedded Systems, 2003

2002
Cryptanalysis of Polly Cracker.
IEEE Trans. Inf. Theory, 2002

On "A New Representation of Elements of Finite Fields GF (2<sup>m</sup>) Yielding Small Complexity Arithmetic Circuits".
IEEE Trans. Computers, 2002

Cryptanalysis of a knapsack-like cryptosystem.
Period. Math. Hung., 2002

Involutive Bases in the Weyl Algebra.
J. Symb. Comput., 2002

Attacking a polynomial-based cryptosystem: Polly Cracker.
Int. J. Inf. Sec., 2002

Reaction Attacks on Public Key Cryptosystems Based on the Word Problem.
IACR Cryptol. ePrint Arch., 2002

Weak Keys in MST1.
IACR Cryptol. ePrint Arch., 2002

Über Quantencomputer und Quantenkryptographie.
Datenschutz und Datensicherheit, 2002

2001
On using quantum protocols to detect traffic analysis.
Quantum Inf. Comput., 2001

Clouds over a public key cryptosystem based on Lyndon words.
Inf. Process. Lett., 2001

Kryptoanalyse der Ruland/Schweitzer-Signatur von Bitströmen.
Datenschutz und Datensicherheit, 2001

Loopholes in Two Public Key Cryptosystems Using the Modular Group.
Proceedings of the Public Key Cryptography, 2001

Cryptanalysis of Two Sparse Polynomial Based Public Key Cryptosystems.
Proceedings of the Public Key Cryptography, 2001

A Theoretical DPA-Based Cryptanalysis of the NESSIE Candidates FLASH and SFLASH.
Proceedings of the Information Security, 4th International Conference, 2001

Attacking the Affine Parts of SFLASH.
Proceedings of the Cryptography and Coding, 2001

2000
Gröbner Bases Applied to Finitely Generated Field Extensions.
J. Symb. Comput., 2000

On computing a separating transcendence basis.
SIGSAM Bull., 2000

Recognizing Simple Subextensions of Purely Transcendental Field Extensions.
Appl. Algebra Eng. Commun. Comput., 2000

Weaknesses in the SL<sub>2</sub>(IF<sub>s<sup>2</sup></sub>) Hashing Scheme.
Proceedings of the Advances in Cryptology, 2000

Zur algorithmischen Zerlegung polynomialer Gleichungssysteme.
PhD thesis, 2000

1999
Basic Algorithms for Rational Function Fields.
J. Symb. Comput., 1999

Decomposing Systems of Polynomial Equations.
Proceedings of the Second Workshop on Computer Algebra in Scientific Computing, 1999


  Loading...