Martin Kreuzer

Orcid: 0000-0002-4732-2627

Affiliations:
  • University of Passau, Germany


According to our database1, Martin Kreuzer authored at least 35 papers between 2000 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
SAT Solving Using XOR-OR-AND Normal Forms.
Math. Comput. Sci., December, 2024

Computing the binomial part of a polynomial ideal.
J. Symb. Comput., 2024

2021
Further potential applications of group theory in information security.
Int. J. Comput. Math. Comput. Syst. Theory, 2021

A fault attack on KCipher-2.
Int. J. Comput. Math. Comput. Syst. Theory, 2021

A Fault Attack on the Family of Enocoro Stream Ciphers.
Cryptogr., 2021

2020
A Signature Based Border Basis Algorithm.
Math. Comput. Sci., 2020

Computing Coupled Border Bases.
Math. Comput. Sci., 2020

On conversions from CNF to ANF.
J. Symb. Comput., 2020

Computing subschemes of the border basis scheme.
Int. J. Algebra Comput., 2020

A fault attack on the Niederreiter cryptosystem using binary irreducible Goppa codes.
CoRR, 2020

2018
Refutation of Products of Linear Polynomials.
Proceedings of the 3rd Workshop on Satisfiability Checking and Symbolic Computation co-located with Federated Logic Conference, 2018

3BA: A Border Bases Solver with a SAT Extension.
Proceedings of the Mathematical Software - ICMS 2018, 2018

2017
Integrating Algebraic and SAT Solvers.
Proceedings of the Mathematical Aspects of Computer and Information Sciences, 2017

Towards mixed structural-functional models for algebraic fault attacks on ciphers.
Proceedings of the IEEE 2nd International Verification and Security Workshop, 2017

AutoFault: Towards Automatic Construction of Algebraic Fault Attacks.
Proceedings of the 2017 Workshop on Fault Diagnosis and Tolerance in Cryptography, 2017

2016
Computing Boolean Border Bases.
Proceedings of the 18th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2016

2014
Learning with Cross-Kernels and Ideal PCA.
CoRR, 2014

Dual-to-kernel learning with ideals.
CoRR, 2014

A Linear Algebra Attack to Group-Ring-Based Key Exchange Protocols.
Proceedings of the Applied Cryptography and Network Security, 2014

2013
Multi-Stage Fault Attacks on Block Ciphers.
IACR Cryptol. ePrint Arch., 2013

Estimating Photo-Voltaic Power Supply without Smart Metering Infrastructure.
Proceedings of the Energy-Efficient Data Centers - Second International Workshop, 2013

Fault-based attacks on cryptographic hardware.
Proceedings of the 16th IEEE International Symposium on Design and Diagnostics of Electronic Circuits & Systems, 2013

2012
An Algebraic Fault Attack on the LED Block Cipher.
IACR Cryptol. ePrint Arch., 2012

A Fault Attack on the LED Block Cipher.
Proceedings of the Constructive Side-Channel Analysis and Secure Design, 2012

2011
Subideal border bases.
Math. Comput., 2011

2010
Algebraic attacks using SAT-solvers.
Groups Complex. Cryptol., 2010

2009
Approximate computation of zero-dimensional polynomial ideals.
J. Symb. Comput., 2009

Algebraisches Erdöl.
Inform. Spektrum, 2009

Alles logisch, oder was?
Inform. Spektrum, 2009

Algebraic Attacks Galore!
Groups Complex. Cryptol., 2009

2006
Gröbner Basis Cryptosystems.
Appl. Algebra Eng. Commun. Comput., 2006

Logik für Informatiker.
Pearson Studium, ISBN: 978-3-8273-7215-4, 2006

2005
Computing zero-dimensional schemes.
J. Symb. Comput., 2005

2004
Efficiently computing minimal sets of critical pairs.
J. Symb. Comput., 2004

2000
Computing Ideals of Points.
J. Symb. Comput., 2000


  Loading...