RO EN
New primitives for digital signature algorithms
Authors: N. A. Moldovyan and P. A. Moldovyanu
– 0.25 Mb
Abstract
Particular types of the multiplication operation over elements of the finite vector space over the field GF(pd), are introduced so that there are formed the finite fields GF((pd)m) with fast multiplication operation that also suites well to parallelized implementation. Finite fields implemented in such form are proposed for accelerating the digital signature algorithms.Fulltext
– 0.25 Mb
Contents
- New fuzzy subquasigroups
- Vague Lie subalgebras over a vague field
- A probabilistic model of error-detecting codes based on quasigroups
- Pure ideals in ternary semigroups
- Secret-sharing schemes and orthogonal systems of k-ary operations
- Prolongations of quasigroups by middle translations
- Periodic quasigroup string transformations
- Skew endomorphisms on some n-ary groups
- Construction for subdirectly irreducible sloops of cardinality n2^m
- N-fuzzy quasi-ideals in ordered semigroups
- Generalized quadratic quasigroup equations with tree variables
- New primitives for digital signature algorithms
- Congruencies on an inverse AG**-groupoid via the natural partial order
