Patrick Dehornoy

Suggest Changes
Learn More
Define a Garside monoid to be a cancellative monoid where right and left lcm’s exist and that satisfy additional finiteness assumptions, and a Garside group to be the group of fractions of a Garside(More)
We survey some of the recently developed cryptographic schemes involving Artin’s braid groups, as well as the attacks against these schemes. We also point out some hints for future work.
— In the decade since the discovery that Artin’s braid groups enjoy a left-invariant linear ordering, several quite different approaches have been applied to understand this phenomenon. This book is(More)