10 citations · 14 across the 2 of their papers we have counts for
2 papers
cs.LO2023★ 4 cited
SAT Solving Using XOR-OR-AND Normal Forms
Bernhard Andraschko, Julian Danner, Martin Kreuzer
This paper introduces the XOR-OR-AND normal form (XNF) for logical formulas. It is a generalization of the well-known Conjunctive Normal Form (CNF) where literals are replaced by X…
cs.IT2020★ 10 cited
A fault attack on the Niederreiter cryptosystem using binary irreducible Goppa codes
Julian Danner, Martin Kreuzer
A fault injection framework for the decryption algorithm of the Niederreiter public-key cryptosystem using binary irreducible Goppa codes and classical decoding techniques is descr…