#### Filter Results:

#### Publication Year

2009

2012

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

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 conceptual graphs. Since graph homomorphism checking is an NP-Complete problem, the main requirement for database… (More)

Vectorial Boolean functions are usually called Substitution Boxes (S-Boxes) and are used as basic component of block ciphers in Cryptography. The ciphers that are Substitution-permutation networks use bijective S-Boxes i.e., Boolean permutations. S-Boxes with low differential uniformity and high nonlinearity are considered as cryptographically strong. In… (More)

- ‹
- 1
- ›