Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Mamadolimov, Abdurashid"'
We construct 8 x 8 bijective cryptographically strong S-boxes. Our construction is based on using non-bijective power functions over the finite filed.
Externí odkaz:
http://arxiv.org/abs/1301.4723
Autor:
Mamadolimov, Abdurashid
We consider a database composed of a set of conceptual graphs. Using conceptual graphs and graph homomorphism it is possible to build a basic query-answering mechanism based on semantic search. Graph homomorphism defines a partial order over conceptu
Externí odkaz:
http://arxiv.org/abs/1207.2837
Publikováno v:
Pertanika Journal of Science & Technology; Oct2011 Supplement, Vol. 19, p1-9, 9p
