Article
Licensed
Unlicensed
Requires Authentication
On homomorphisms of many-sorted algebraic systems in connection with cryptographic applications
-
A. D. Anosov
Published/Copyright:
December 4, 2007
Abstract
Homomorphisms of many-sorted algebraic systems are considered, under which the elements of basic sets, operators, and predicates may be related; such homomorphisms are used for setting and solving equations (relations) over many-sorted algebraic systems among the unknowns of which may occur the elements of basic sets, operators, and predicates.
Published Online: 2007-12-04
Published in Print: 2007-10-19
© de Gruyter
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- Asymptotic formulas and limit distributions for combinatorial configurations generated by polynomials
- On homomorphisms of many-sorted algebraic systems in connection with cryptographic applications
- A general approach to studying the stability of a Pareto optimal solution of a vector integer linear programming problem
- An upper bound for the number of maximal independent sets in a graph
- On constructing circuits for transforming the polynomial and normal bases of finite fields from one to the other
- One automaton model in biology
- On an automaton model of pursuit
Articles in the same Issue
- Asymptotic formulas and limit distributions for combinatorial configurations generated by polynomials
- On homomorphisms of many-sorted algebraic systems in connection with cryptographic applications
- A general approach to studying the stability of a Pareto optimal solution of a vector integer linear programming problem
- An upper bound for the number of maximal independent sets in a graph
- On constructing circuits for transforming the polynomial and normal bases of finite fields from one to the other
- One automaton model in biology
- On an automaton model of pursuit
