Higher Order c-Differentials

ON SOME CLASSES OF BI-UNIVALENT FUNCTIONS

A checking test for a monotone read-once function f depending essentially on all its n variables is a set of vectors M distinguishing f from all other monotone read-once functions of the same variables. We describe an inductive procedure for obtaining individual lower and upper bounds on the minimal number of vectors T(f) in a checking test for any function f. The task of deriving the exact value of T(f) is reduced to a combinatorial optimization problem related to graph connectivity. We show that for almost all functions f expressible by read-once conjunctive or disjunctive normal forms, T(f) ~n / ln n. For several classes of functions our results give the exact value of T(f).

Have decidual natural killer (dNK) cells a different microRNA (miRNA or miR) expression pattern compared to NK cells circulating in the peripheral blood (pb) of healthy pregnant women in the first trimester of gestation? dNK cells have a unique miRNA profile, showing exclusive expression of a set of miRNAs and significant up- or down-regulation of most of the miRNAs shared with pbNK cells. dNK cells differ from pbNK cells both phenotypically and functionally, and their origin is still debated. Many studies have indicated that miRNAs regulate several important aspects of NK cell biology, such as development, activation and effector functions. Decidua basalis and peripheral blood specimens were collected from women (n = 7) undergoing voluntary termination of gestation in the first trimester of pregnancy. dNK and pbNK cells were then highly purified by cell sorting. miRNAs expression was analysed by quantitative RT-PCR (qRT-PCR)-based arrays using RNA purified from freshly isolated and highly purified pbNK and dNK cells. Results from arrays were validated by qRT-PCR assays. The bioinformatics tool ingenuity pathway analysis (IPA) was applied to determine the cellular network targeted by validated miRNAs and the correlated biological functions. Herein, we identified the most differentially expressed miRNAs in NK cells isolated from peripheral blood and uterine decidua of pregnant women. We found that 36 miRNAs were expressed only in dNK cells and two miRNAs only in pbNK cells. Moreover, 48 miRNAs were commonly expressed by both NK cell preparations although at different levels: 28 were upregulated in dNK cells, while 15 were downregulated compared to pbNK cells. Validation of a selected set (n = 11) of these miRNAs confirmed the differential expression of nine miRNAs: miR-10b and miR-214 expressed only in dNK cells and miR-200a-3p expressed only in pbNK cells; miR-130b-3p, miR-125a-5p, miR-212-3p and miR-454 were upregulated while miR-210-3p and miR-132 were downregulated in dNK cells compared to pbNK cells. IPA network analysis identified a single network connecting all the miRNAs as well as their significant involvement in several classes of functions: 'Organismal injury, Reproductive system disease, Inflammatory disease' and 'Cellular development'. These miRNAs target molecules such as argonaute 2, tumour protein p53, insulin and other genes that belong to the same network and significantly influence cell differentiation and pregnancy. In the present study, the cellular network and biological functions modulated by miRNAs differentially expressed in dNK and pbNK cells were identified by IPA considering only molecules and relationships that were with confidence 'experimentally observed' in leucocytes. The decidual and pbNK cells that were analysed here are a heterogeneous population and further study will help to disentangle whether there are differences in miRNA production by the different subsets of NK cells. This is the first study describing a different miRNA expression profile in dNK cells compared to matched pbNK cells during the first trimester of pregnancy. Our findings improved the body of knowledge on dNK cell biology and strongly suggest further investigation into the roles of miRNAs that are differentially expressed in human dNK compared to pbNK cells. Our results suggest that specific miRNAs can modulate dNK cell origin and functions, highlighting a potential role of this miRNA signature in human development and diseases. This work was supported by grants from the Istituto Pasteur, Fondazione Cenci Bolognetti, the European NoE EMBIC within FP6 (Contract number LSHN-CT-2004-512040), Istituto Italiano di Tecnologia, and Ministero dell'Istruzione, dell'Università e della Ricerca (Ricerche Universitarie), and from Università Politecnica delle Marche. There are no conflicts of interest to declare.

On the tractability of the Brownian Bridge algorithm

The delay of circuits whose inputs have specified arrival times

Many voting systems consist of a set of players who can form coalitions; a winning coalition is one that can pass a measure. The winning and losing coalitions can be given by several classes of functions, including switching functions, threshold functions, weighted voting systems, and simple games. We define a zonotope T n T_n related to these functions and describe its coordinates in terms of a measure of voting power. We also give a voting interpretation of the coordinates of the derived zonotope T ¯ n \bar {T}_n .

We consider the eigenvalue problem associated with the Dunkl-type differential operator (in which the reflection operator R is involved)in the context of supersymmetric quantum mechanical models. By solving this eigenvalue problem with the help of known exactly solvable potentials, we construct several classes of functions satisfying certain orthogonality relations. We call them the Dunkl-supersymmetric (Dunkl-SUSY) orthogonal functions. These functions can be expressed in terms of the classical orthogonal polynomials. The key feature of these functions is that they appear by pairs, i.e. Qn(x) and Qn(−x) are both the eigenfunctions of . A general formulation of the Dunkl-SUSY orthogonal polynomials is also presented.

Let varGamma (x) denote the classical Euler gamma function. The logarithmic derivative psi (x)=[ln varGamma (x)]'=frac{varGamma '(x)}{ varGamma (x)}, psi '(x), and psi ''(x) are, respectively, called the digamma, trigamma, and tetragamma functions. In the paper, the authors survey some results related to the function [psi '(x)]^{2}+ psi ''(x), its q-analogs, its variants, its divided difference forms, several ratios of gamma functions, and so on. These results include the origins, positivity, inequalities, generalizations, completely monotonic degrees, (logarithmically) complete monotonicity, necessary and sufficient conditions, equivalences to inequalities for sums, applications, and the like. Finally, the authors list several remarks and pose several open problems.

Statistical attacks on block ciphers make use of a property of the cipher so that an event occurs with different probabilities depending on whether or not the correct key is used. For instance, differential cryptanalysis [3] and truncated differential cryptanalysis [5] consider characteristics or differentials which show that a particular output difference should be obtained with a relatively high probability when a particular input difference is used. Hence, when the correct key is used, the predicted differences occur more frequently.

Medical Therapy for Heart Failure With Reduced Ejection Fraction: The CHAMP-HF Registry

Differential Cryptanalysis (DC) is one of the oldest known attacks on block ciphers. DC is based on tracking of changes in the differences between two messages as they pass through the consecutive rounds of encryption. However DC remains very poorly understood. In his textbook written in the late 1990s Schneier wrote that against differential cryptanalysis, GOST is “probably stronger than DES”. In fact Knudsen have soon proposed more powerful advanced differential attacks however the potential space of such attacks is truly immense. To this day there is no method which allows to evaluate the security of a cipher against such attacks in a systematic way. Instead, attacks are designed and improved in ad-hoc ways with heuristics [6–13,21]. The best differential attack known has time complexity of 2179 [13]. In this paper we show that for a given block cipher there exists an optimal size for advanced differential properties. This new understanding allows to considerably reduce the space to be searched for “good” truncated differential properties suitable for an attack.

This paper analyzes the security of the RC5 encryption algorithm against differential and linear cryptanalysis. RC5 is a new block cipher recently designed by Ron Rivest. It has a variable word size, a variable number of rounds, and a variable-length secret key. In RC5, the secret key is used to fill an expanded key table which is then used in encryption. Both our differential and linear attacks on RC5 recover every bit of the expanded key table without any exhaustive search. However, the plaintext requirement is strongly dependent on the number of rounds. For 64-bit block size, our differential attack on nine-round RC5 uses 245 chosen plaintext pairs (about the same as DES), while 262 pairs are needed for 12-round RC5. Similarly, our linear attack on live-round RC5 uses 247 known plaintexts (about the same as DES), and the plaintext requirement is impractical for more than six rounds. We conjecture that the linear approximations used in our linear cryptanalysis are optimal. Thus, we conclude that Rivest's suggested use of 12 rounds is sufficient to make differential and linear cryptanalysis of RC5 impractical.

In this paper, we analyze the security of two recently proposed ultra-lightweight block ciphers, SLIM and LCB. SLIM is designed based on the Feistel paradigm, operating on 32-bit blocks and has an 80-bit key. The designers claim that SLIM is immune to differential cryptanalysis after they were only able to find a trail of up to 7 rounds by using a heuristic method. LCB is another ultra-lightweight block cipher with a 32-bit block and instead uses a 64-bit secret key. It was designed based on a hybrid of Feistel and substitution-permutation network structures. Although no concrete security analyses were performed, the designers claim that 10 rounds of the cipher is secure enough against various attacks including differential cryptanalysis. We verify these claims by proposing differential attacks on both ciphers. For SLIM, we first report optimal (i.e., having the best differential probability) trails for up to 32 rounds found using an SMT solver. We then propose practical key recovery attacks on up to 14 rounds that recover the final round key with time complexity \(2^{32}\). Next, a close inspection of LCB’s design revealed a lack of nonlinearity, whereby its S-box could be modelled as a permutation. As such, differential trails that hold with probability 1 can be trivially derived for any number of rounds of the cipher. A trivial distinguishing attack can be performed with just one known-ciphertext. We fix this flaw and go on to show that LCB is actually more secure (against differential cryptanalysis) than SLIM given the same number of rounds. To the best of our knowledge, these are the first third-party cryptanalysis attacks against both ciphers.KeywordsSLIMLCBDifferential cryptanalysisLightweight block cipherSMT

International audience

Boomerang uniformity of some classes of functions over finite fields