A new Protocol for 1-2 Oblivious Transfer
A new protocol for 1-2 (String) Oblivious Transfer is proposed. The protocol uses 5 rounds of message exchange.
cs.CR↗
arXiv subjects
Bjoern Grohmann
Publications and source records attributed to Bjoern Grohmann.
On the Existence of certain Quantum Algorithms
We investigate the question if quantum algorithms exist that compute the maximum of a set of conjugated elements of a given number field in quantum polynomial time. We will relate the existence of these algorithms for a certain family of number fields to an open conjecture from elementary number theory.
quant-ph↗
A New Key-Agreement-Protocol
A new 4-pass Key-Agreement Protocol is presented. The security of the protocol mainly relies on the existence of a (polynomial-computable) One-Way-Function and the supposed computational hardness of solving a specific system of equations.
cs.CR↗
On the Zeros of Fermat Quotients and Mirimanoff Polynomials
In this article an upper bound for the first consecutive zeros of the Fermat quotient is given in terms of the zeros of a Mirimanoff polynomial. This bound is obtained by investigating a relation between these polynomials and the factor system of Gauss sums of a certain number field.
math.NT↗
Slim normal Bases and Basefield Transforms
In this article, we define the notion of slim (normal) bases and show their existence for various fields. As an application, an algorithm will be given that computes the spectrum of a basefield transform by merely using O(n) additions.
math.NT↗