RO EN
Spurious multiplicative group of GF(pm): a new tool for cryptography
Authors: C. Koscielny
– 0.27 Mb
Abstract
An unconventional approach to cryptography, consisting in application of an algebraic structure, called spurious multiplication group of GF(pm) and denoted as SMG(pm), the operation table of which is not, in general, a Latin square, has been presented. This algebraic system is a natural generalization of the multiplicative group of GF(pm), so, one can operate on elements of these two structures using the same routine or the same hardware. On the basis of SMG(pm) many strong symmetric-key ciphers, and at least, as it is shown in the paper, one public-key cipher, can be built.C. Koscielny
Academy of Management in Legnica,
Faculty of Computer Science,
ul. Reymonta 21,
59-220 Legnica,
Poland.
E-mail:
Academy of Management in Legnica,
Faculty of Computer Science,
ul. Reymonta 21,
59-220 Legnica,
Poland.
E-mail:
Fulltext
– 0.27 Mb
Contents
- Extending sloops of cardinality 16 to SQS-skeins with all possible congruence lattices
- Weak implicative hyper BCK-ideals
- Necessary and sufficient conditions for the continuity of a pre-Haar system at a unit with singleton orbit
- The structure of extra loops
- Spurious multiplicative group of GF(pm): a new tool for cryptography
- Embedding of an AG**-groupoid in a commutative monoid
- Permutation representations of triangle group ?(2,4,5)
- Quotient hyper BCK-algebras
- Affine regular pentagons in GSquasigroups
