We invesitage the multiplicative loops of finite semifields. We show that the group generated by the left and right multiplication maps contains the special linear group. This resu...
Recently non-abelian groups have attracted the attention of cryptographers for constructing public-key cryptographic protocols. In this paper we use the conjugacy problem in non-a...
Abstract. We study the natural problem of secure n-party computation (in the passive, computationally unbounded attack model) of the n-product function fG(x1, . . . , xn) = x1 · x...
Yvo Desmedt, Josef Pieprzyk, Ron Steinfeld, Huaxio...
The Pollard kangaroo method solves the discrete logarithm problem (DLP) in an interval of size N with heuristic average case expected running time approximately 2 √ N group opera...
In this paper, we study the atomic multicast problem, a fundamental abstraction for building faulttolerant systems. In the atomic multicast problem, the system is divided into non...