this paper presents a new audio encryption algorithm based on permutation and residue number system. in the current approach, signal samples are combined with residue number system through permutation; therefore, a specific noise is generated. then, the audio signal is combined with the noise, generated by the algorithm, to produce a silence signal. for this purpose, the algorithm uses a predef...

A permutation class is splittable if it is contained in the merge of two of its proper subclasses. We characterise the unsplittable subclasses of the class of separable permutations both structurally and in terms of their bases.

and Applied Analysis 3 3.3. The Time Complexity of Generation Algorithm Based on Permutation. Computational complexity is divided into two kinds: one is time complexity, and the other is space complexity. The analysis of space complexity is similar to that of time complexity, and the analysis of space complexity is more simple [12]; in this paper, the two algorithms’ space complexities are the ...

We propose two new instructions, swperm and sieve, that can be used to efficiently complete an arbitrary bit-level permutation of an n-bit word with or without repetitions. Permutations with repetitions are rearrangements of an ordered set in which elements may replace other elements in the set; such permutations are useful in cryptographic algorithms. On a 4-way superscalar processor, an arbit...

Block ciphers are used to encrypt data and provide data confidentiality. For interoperability reasons, it is desirable to support a variety of block ciphers efficiently. Of the basic operations in block ciphers, only bit permutation is very slow on existing processors, followed by integer multiplication. Although new permutation instructions proposed recently can accelerate bit permutations in ...

The slide attack is applicable to ciphers that can be represented as an iterative application of the same keyed permutation. The slide attack leverages simple attacks on the keyed permutation to more complicated (and time consuming) attacks on the entire cipher. In this paper we extend the slide attack by examining the cycle structures of the entire cipher and of the underlying keyed permutatio...

The same holds for continuous maps of the real line into itself, except that we may have P (f) = ∅. All proofs of Sharkovsky’s Theorem inevitably lead to an idea of a “type” of a cycle. For instance, when ordering the points of a cycle p1 < p2 < · · · < pn, one gets a cyclic permutation σ corresponding to it, such that pi is mapped to pσ(i). Combinatorial Dynamics deals with types of cycles (de...

Abstract. Let H be a permutation group on a set Λ, which is permutationally isomorphic to a finite alternating or symmetric group An or Sn acting on the k-element subsets of points from {1, . . . , n}, for some arbitrary but fixed k. Suppose moreover that no isomorphism with this action is known. We show that key elements of H needed to construct such an isomorphism φ, such as those whose image...

In this short note, we give a description of the Parry-Sullivan number of a graph in terms of the cycles in the graph. This tool is occasionally useful in reasoning about the Parry-Sullivan numbers of graphs. Given a graph E with n vertices, one may define the incidence matrix AE as the n × n matrix wherein each entry (AE)ij is defined to be the number of edges in E from the ith vertex to the j...