Results 81 to 90 of about 382,738 (264)
General Diffusion Analysis: How to Find Optimal Permutations for Generalized Type-II Feistel Schemes
IACR Transactions on Symmetric Cryptology, 2019 Type-II Generalized Feistel Schemes are one of the most popular versions of Generalized Feistel Schemes. Their round function consists in applying a classical Feistel transformation to p sub-blocks of two consecutive words and then shifting the k = 2p ...
Victor Cauchois +2 more
doaj +1 more source
Pseudo-Permutations II: Geometry and Representation Theory [PDF]
Discrete Mathematics & Theoretical Computer Science, 2001 In this paper, we provide the second part of the study of the pseudo-permutations. We first derive a complete analysis of the pseudo-permutations, based on hyperplane arrangements, generalizing the usual way of translating the permutations. We then study
François Boulier +3 more
doaj +1 more source
Discrete Mathematics, 1989 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Longest increasing subsequences of random colored permutations [PDF]
, 1999 We compute the limit distribution for (centered and scaled) length of the longest increasing subsequence of random colored permutations. The limit distribution function is a power of that for usual random permutations computed recently by Baik, Deift ...
Borodin, Alexei
core +1 more source
FEBS Letters, EarlyView.We reconstituted Synechocystis glycogen synthesis in vitro from purified enzymes and showed that two GlgA isoenzymes produce glycogen with different architectures: GlgA1 yields denser, highly branched glycogen, whereas GlgA2 synthesizes longer, less‐branched chains.
Kenric Lee +3 more
wiley +1 more source
Journal of Combinatorial Theory, Series A, 2004 Chung and Graham define quasirandom subsets of $\mathbb{Z}_n$ to be those with any one of a large collection of equivalent random-like properties. We weaken their definition and call a subset of $\mathbb{Z}_n$ $ $-balanced if its discrepancy on each interval is bounded by $ n$.
openaire +3 more sources
Permutation and complete permutation polynomials
Finite Fields and Their Applications, 2015 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bassalygo, L. A., Zinoviev, V. A.
openaire +1 more source
Structural biology of ferritin nanocages
FEBS Letters, EarlyView.Ferritin is a conserved iron‐storage protein that sequesters iron as a ferric mineral core within a nanocage, protecting cells from oxidative damage and maintaining iron homeostasis. This review discusses ferritin biology, structure, and function, and highlights recent cryo‐EM studies revealing mechanisms of ferritinophagy, cellular iron uptake, and ...
Eloise Mastrangelo, Flavio Di Pisa
wiley +1 more source
On a mnemonic construction of permutations
Journal of Mathematical Cryptology, 2017 In the past when only “paper and pencil” ciphers were in use, a mnemonic Bellaso’s method was applied to obtain a permutation from a meaningful phrase. It turns out that even nowadays this method and its variations are employed and provide a simple but ...
Antal Eugen, Grošek Otokar, Horak Peter
doaj +1 more source
, 2011 This article studies the poset of simple permutations with respect to the pattern involvement. We specify results on critically indecomposable posets obtained by Schmerl and Trotter to simple permutations and prove that if $\sigma, \pi$ are two simple ...
Adeline, Pierrot, Dominique, Rossin
core +1 more source