10 citations · 10 across the 1 of their papers we have counts for
2 papers
cs.CR2013★ 10 cited
Practical Bijective S-box Design
Abdurashid Mamadolimov, Herman Isa, Moesfa Soeheila Mohamad
We construct 8 x 8 bijective cryptographically strong S-boxes. Our construction is based on using non-bijective power functions over the finite filed.
cs.DS2012
Search Algorithms for Conceptual Graph Databases
Abdurashid Mamadolimov
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 sem…