3 papers
cs.IT2008
Efficient recovering of operation tables of black box groups and rings
Jens Zumbragel, Gerard Maze, Joachim Rosenthal
People have been studying the following problem: Given a finite set S with a hidden (black box) binary operation * on S which might come from a group law, and suppose you have acce…
cs.CR2005
Public Key Cryptography based on Semigroup Actions
G. Maze, C. Monico, J. Rosenthal
A generalization of the original Diffie-Hellman key exchange in found a new depth when Miller and Koblitz suggested that such a protocol could be used with the group o…
math.GM2004
A New Family of Almost Identities
Gerard Maze, Lorenz Minder
This paper presents a new family of almost identities. These are based on series that sum to elements close to either rationals or rational multiples of pi. The explanation of the…