Many cryptographic algorithms are vulnerable to side channel analysis and several leakage models have been introduced to better understand these flaws. In 2003, Ishai, Sahai and Wagner introduced the d-probing security model, in which an attacker can observe at most d intermediate values during a processing. They also proposed an algorithm that securely performs the multiplication of 2 bits in ...

‎let $g$ be a finite group and $pi_{e}(g)$ be the set of element‎ ‎orders of $g$‎. ‎let $k in pi_{e}(g)$ and $m_{k}$ be the number of‎ ‎elements of order $k$ in $g$‎. ‎set nse($g$):=${ m_{k} | k in‎ ‎pi_{e}(g)}$‎. ‎in this paper‎, ‎we prove that if $g$ is a group such‎ ‎that nse($g$)=nse($psl(2‎, ‎25)$)‎, ‎then $g cong psl(2‎, ‎25) $‎.

‎let $g$ be a finite group and $pi_{e}(g)$ be the set of element‎ ‎orders of $g$‎. ‎let $k in pi_{e}(g)$ and $m_{k}$ be the number of‎ ‎elements of order $k$ in $g$‎. ‎set nse($g$):=${ m_{k} | k in‎ ‎pi_{e}(g)}$‎. ‎in this paper‎, ‎we prove that if $g$ is a group such‎ ‎that nse($g$)=nse($psl(2‎, ‎25)$)‎, ‎then $g cong psl(2‎, ‎25) $‎.

We completely determine the complexity status of the dominating set problem for hereditary graph classes defined by forbidden induced subgraphs with at most five vertices.

A permutation is said to be –avoiding if it does not contain any subsequence having all the same pairwise comparisons as . This paper concerns the characterization and enumeration of permutations which avoid a set of subsequences increasing both in number and in length at the same time. Let be the set of subsequences of the form “ ”, being any permutation on . For ! the only subsequence in #" i...

We completely determine the complexity status of the 3-colorability problem for hereditary graph classes defined by two forbidden induced subgraphs with at most five vertices. © 2015 Elsevier B.V. All rights reserved.