Increasing the immunity of AES against the algebraic attacks by using the dynamic key dependent S-Boxes and studying its effect on AES immunity against the classic attacks

The security of several recently proposed ciphers relies on the fact:" that the classical methods of cryptanalysis (e.g. linear or differential attacks) are based on probabilistic characteristics, which makes their security grow exponentially with the number of rounds". So they haven’t the suitable immunity against the algebraic attacks which becomes more powerful after XSL algorithm. in this research we will try some method to increase the immunity of AES algorithm against the algebraic attacks then we will study the effect of this adjustment.

Criteria to Distinguish non-Isomorphism Hypergraphs

The paper aims to distinguish the couple-couple non-isomorphism hypergraphs, which have a known vertexes number, Z, and sides number, d. To solve this problem a number of criteria graded in distinguishing accuracy are developed. It also presents an experimental method to test the efficiency of the used criteria. It gives a method to put them in order. This research is considered a practical because it is useful in designing of machines and variable structure complex systems, and in comparing the new patterns.