Results 1 to 6 of about 6 (6)
Pseudo-free families and cryptographic primitives
In this article, we study the connections between pseudo-free families of computational Ω\Omega -algebras (in appropriate varieties of Ω\Omega -algebras for suitable finite sets Ω\Omega of finitary operation symbols) and certain standard cryptographic ...
Anokhin Mikhail
doaj +1 more source
The algorithmic complexity of group algebras
<p><strong>Key words:</strong> Algebraic algorithm complexity, Theorem Alder-Strassen, Algorithm Strassen, Group algebra.</p><p><strong>AMS Mathematics Subject Classification:</strong> 08A62<br><strong ...
Yuan B., R.K. Kerimbayev,
core +1 more source
Pseudo-free families of computational universal algebras
Let Ω be a finite set of finitary operation symbols. We initiate the study of (weakly) pseudo-free families of computational Ω-algebras in arbitrary varieties of Ω-algebras.
Anokhin Mikhail
doaj +1 more source
The Clone of K*(n, r)-Full Terms
Let τn be a type of algebras in which all operation symbols have arity n, for a fixed n ≥ 1. For 0 < r ≤ n, this paper introduces a special kind of n-ary terms of type τn called K*(n, r)-full terms. The set of all K*(n, r)-full terms of type τn is closed
Wattanatripop Khwancheewa +1 more
doaj +1 more source
Algebraic generalization of Diffie–Hellman key exchange
The Diffie–Hellman key exchange scheme is one of the earliest and most widely used public-key primitives. Its underlying algebraic structure is a cyclic group and its security is based on the discrete logarithm problem (DLP).
Partala Juha
doaj +1 more source
On some congruences of power algebras
Pilitowska Agata, Zamojska-Dzienio Anna
doaj +1 more source

