All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Page 1

Displaying 1 – 13 of 13

Showing per page

Computation of centralizers in Braid groups and Garside groups.

Nuno Franco, Juan González-Meneses (2003)

Revista Matemática Iberoamericana

We give a new method to compute the centralizer of an element in Artin braid groups and, more generally, in Garside groups. This method, together with the solution of the conjugacy problem given by the authors in [9], are two main steps for solving conjugacy systems, thus breaking recently discovered cryptosystems based in braid groups [2]. We also present the result of our computations, where we notice that our algorithm yields surprisingly small generating sets for the centralizers.

Construction, properties and applications of finite neofields

Anthony Donald Keedwell (2000)

Commentationes Mathematicae Universitatis Carolinae

We give a short account of the construction and properties of left neofields. Most useful in practice seem to be neofields based on the cyclic group and particularly those having an additional divisibility property, called D-neofields. We shall give examples of applications to the construction of orthogonal latin squares, to the design of tournaments balanced for residual effects and to cryptography.

Cryptographic Primitives with Quasigroup Transformations

Mileva, Aleksandra (2010)

Mathematica Balkanica New Series

AMS Subj. Classification: Primary 20N05, Secondary 94A60The intention of this research is to justify deployment of quasigroups in cryptography, especially with new quasigroup based cryptographic hash function NaSHA as a runner in the First round of the ongoing NIST SHA-3 competition. We present new method for fast generation of huge quasigroup operations, based on the so-called extended Feistel networks and modification of the Sade’s diagonal method. We give new design of quasigroup based family of...

Cryptography based on number fields with large regulator

Johannes Buchmann, Markus Maurer, Bodo Möller (2000)

Journal de théorie des nombres de Bordeaux

We explain a variant of the Fiat-Shamir identification and signature protocol that is based on the intractability of computing generators of principal ideals in algebraic number fields. We also show how to use the Cohen-Lenstra-Martinet heuristics for class groups to construct number fields in which computing generators of principal ideals is intractable.

Currently displaying 1 – 13 of 13

Page 1