In this paper we pick up an old challenge to design public key or white-box constructions from symmetric cipher components. We design several encryption schemes based on the ASASA structure ranging from fast and generic symmetric ciphers to compact public key and white-box constructions based on generic affine transformations combined with specially designed low degree non-linear layers. While ...

A t-(v, k, λ) design is quasi-symmetric if there are only two block intersection sizes. We adapt the Kramer-Mesner construction method for designs with prescribed automorphism groups to the quasi-symmetric case. Using the adapted method, we find many new quasi-symmetric 2-(28, 12, 11) and 2-(36, 16, 12) designs, establish the existence of quasi-symmetric 2-(56, 16, 18) designs, and find three n...

The FIR 2-band wavelets have found wide applications in practice. One of their disadvantages, however, is that they cannot be made both symmetric and orthogonal. There have been some works on filters which are orthogonal and nearly symmetric. In this paper, Gröbner methods are used to design orthogonal filters with a subset of exactly symmetric coefficients of various lengths, as opposed to nea...

A Metis design is one for which v = r + k + 1. This paper deals with Metis designs that are quasi-residual. The parameters of such designs and the corresponding symmetric designs can be expressed by Fibonacci numbers. Although the question of existence seems intractable because of the size of the designs, the nonexistence of corresponding di¤erence sets can be dealt with in a substantive way. W...

commutative properties of four-dimensional generalized symmetric pseudo-riemannian manifolds were considered. specially, in this paper, we studied skew-tsankov and jacobi-tsankov conditions in 4-dimensional pseudo-riemannian generalized symmetric manifolds.

We solve a problem concerning a combinatorial design involving the transpositions in the symmetric group S2n. The problem admits equivalent formulations in terms of symmetric permutation matrices and 1-factorizations of complete graphs.

Rotation symmetric Boolean functions have important applications in the design of cryptographic algorithms. We prove the conjecture about rotation symmetric Boolean functions (RSBFs) of degree 3 proposed in [1], thus the nonlinearity of such kind of functions are determined.

a graph is textit{symmetric}, if its automorphism group is transitive on the set of its arcs. in this paper, we  classifyall the connected cubic symmetric  graphs of order $36p$  and $36p^{2}$, for each prime $p$, of which the proof depends on the classification of finite simple groups.

we give a survey of recent applications of group rings to combinatorics and tocryptography, including their use in the di erential cryptanalysis of block ciphers.