Multipartite entanglement, quantum-error-correcting codes, and entangling power of quantum evolutions

We investigate the average bipartite entanglement, over all possible divisions of a multipartite system, as a useful measure of multipartite entanglement. We expose a connection between such measures and quantum-error-correcting codes by deriving a formula relating the weight distribution of the code to the average entanglement of encoded states. Multipartite entangling power of quantum evolutions is also investigated.Comment: 13 pages, 1 figur

Two attacks on rank metric code-based schemes: RankSign and an Identity-Based-Encryption scheme

RankSign [GRSZ14a] is a code-based signature scheme proposed to the NIST competition for quantum-safe cryptography [AGHRZ17] and, moreover, is a fundamental building block of a new Identity-Based-Encryption (IBE) [GHPT17a]. This signature scheme is based on the rank metric and enjoys remarkably small key sizes, about 10KBytes for an intended level of security of 128 bits. Unfortunately we will show that all the parameters proposed for this scheme in [AGHRZ17] can be broken by an algebraic attack that exploits the fact that the augmented LRPC codes used in this scheme have very low weight codewords. Therefore, without RankSign the IBE cannot be instantiated at this time. As a second contribution we will show that the problem is deeper than finding a new signature in rank-based cryptography, we also found an attack on the generic problem upon which its security reduction relies. However, contrarily to the RankSign scheme, it seems that the parameters of the IBE scheme could be chosen in order to avoid our attack. Finally, we have also shown that if one replaces the rank metric in the [GHPT17a] IBE scheme by the Hamming metric, then a devastating attack can be found

\u3ci\u3es\u3c/i\u3e-Extremal Additive \u3cb\u3eF\u3csub\u3e4\u3c/sub\u3e\u3c/b\u3e Codes

Binary self-dual codes and additive self-dual codes over F4 have in common interesting properties, for example, Type I, Type II, shadows, etc. Recently Bachoc and Gaborit introduced the notion of s-extremality for binary self-dual codes, generalizing Elkies\u27 study on the highest possible minimum weight of the shadows of binary self-dual codes. In this paper, we introduce a concept of s-extremality for additive self-dual codes over F4, give a bound on the length of these codes with even distance d, classify them up to minimum distance d = 4, give possible lengths and (shadow) weight enumerators for which there exist s-extremal codes with 5 ≤ d ≤ 11 and give five s-extremal codes with d = 7. We construct four s-extremal codes of length n = 13 and minimum distance d = 5. We relate an s-extremal code of length 3d to another s-extremal code of that length, and produce extremal Type II codes from s-extremal codes

Two attacks on rank metric code-based schemes: RankSign and an IBE scheme

International audienceRankSign [29] is a code-based signature scheme proposed to the NIST competition for quantum-safe cryptography [5] and, moreover , is a fundamental building block of a new Identity-Based-Encryption (IBE) [25]. This signature scheme is based on the rank metric and enjoys remarkably small key sizes, about 10KBytes for an intended level of security of 128 bits. Unfortunately we will show that all the parameters proposed for this scheme in [5] can be broken by an algebraic attack that exploits the fact that the augmented LRPC codes used in this scheme have very low weight codewords. Therefore, without RankSign the IBE cannot be instantiated at this time. As a second contribution we will show that the problem is deeper than finding a new signature in rank-based cryptography, we also found an attack on the generic problem upon which its security reduction relies. However, contrarily to the RankSign scheme, it seems that the parameters of the IBE scheme could be chosen in order to avoid our attack. Finally, we have also shown that if one replaces the rank metric in the [25] IBE scheme by the Hamming metric, then a devastating attack can be found

Wave: A New Family of Trapdoor One-Way Preimage Sampleable Functions Based on Codes

We present here a new family of trapdoor one-way Preimage Sampleable Functions (PSF) based on codes, the Wave-PSF family. The trapdoor function is one-way under two computational assumptions: the hardness of generic decoding for high weights and the indistinguishability of generalized $(U,U+V)$-codes. Our proof follows the GPV strategy [GPV08]. By including rejection sampling, we ensure the proper distribution for the trapdoor inverse output. The domain sampling property of our family is ensured by using and proving a variant of the left-over hash lemma. We instantiate the new Wave-PSF family with ternary generalized $(U,U+V)$-codes to design a "hash-and-sign" signature scheme which achieves existential unforgeability under adaptive chosen message attacks (EUF-CMA) in the random oracle model. For 128 bits of classical security, signature sizes are in the order of 15 thousand bits, the public key size in the order of 4 megabytes, and the rejection rate is limited to one rejection every 10 to 12 signatures.Comment: arXiv admin note: text overlap with arXiv:1706.0806

Coupling FEM, Bloch Waves and TMM in Meta Poroelastic Laminates

The propagation of airborne plane waves in the pres- ence of a meta poroelastic laminate, that is a poroelas- tic matrix coated with thin elastic layers at its facings 5 and periodically-embedded with inclusions, is studied. Using the Finite Element Method (FEM) only would result in a drastic increase of the degrees of freedom due to the fine mesh required to account for the very thin coatings. Here, the approach relies on: the Bloch 10 wave expansion of the fields in air; the modal Trans- fer Matrix Method to account for the coatings; and the coupling with the FEM model of the poroelas- tic matrix and the resonant inclusions. The model is developed for reflection and transmission problems 15 and it can account for coatings with multiple layers. The procedure induces the addition of the Bloch co- efficients in the FEM’s linear system at a negligible additional computational cost. It is applied to the meta poroelastic laminates with poroelastic inclusions 20 and rubber shell inclusions. The results are compared with those from the Multiple Scattering Theory and an excellent agreement between the methods is found. The approach offers a numerically-efficient way to ac- count for coatings applied to meta poroelastic layers, 25 and finds applications in industrial prototypes where coatings are widely used

Clinical Practice Guidelines for Childbearing Female Candidates for Bariatric Surgery, Pregnancy, and Post-partum Management After Bariatric Surgery

Emerging evidence suggests that bariatric surgery improves pregnancy outcomes of women with obesity by reducing the rates of gestational diabetes, pregnancy-induced hypertension, and macrosomia. However, it is associated with an increased risk of a small-for-gestational-age fetus and prematurity. Based on the work of a multidisciplinary task force, we propose clinical practice recommendations for pregnancy management following bariatric surgery. They are derived from a comprehensive review of the literature, existing guidelines, and expert opinion covering the preferred type of surgery for women of childbearing age, timing between surgery and pregnancy, contraception, systematic nutritional support and management of nutritional deficiencies, screening and management of gestational diabetes, weight gain during pregnancy, gastric banding management, surgical emergencies, obstetrical management, and specific care in the postpartum period and for newborns

An IND-CCA-Secure Code-Based EncryptionScheme Using Rank Metric

The use of rank instead of Hamming metric has been proposed to address the main drawback of code-based cryptography: large key sizes. There exist several Key Encapsulation Mechanisms (KEM) and Public Key Encryption (PKE) schemes using rank metric including some submissions to the NIST call for standardization of Post-Quantum Cryptography. In this work, we present an IND-CCA PKE scheme based on the McEliece adaptation to rank metric proposed by Loidreau at PQC 2017. This IND-CCA PKE scheme based on rank metric does not use a hybrid construction KEM + symmetric encryption. Instead, we take advantage of the bigger message space obtained by the different parameters chosen in rank metric, being able to exchange multiple keys in one ciphertext. Our proposal is designed considering some specific properties of the random error generated during the encryption. We prove our proposal IND-CCA-secure in the QROM by using a security notion called disjoint simulatability introduced by Saito et al. in Eurocrypt 2018. Moreover, we provide security bounds by using the semi-oracles introduced by Ambainis et al

Sources and Sinks of Greenhouse Gases from European Grasslands and Mitigation Options: The ‘GreenGrass’ Project

Adapting the management of grasslands may be used to enhance carbon sequestration into soil, but could also increase N2O and CH4 emissions. In support of the European post-Kyoto policy, the European \u27GreenGrass\u27 project (EC FP5, EVK2-CT2001-00105) has three main objectives: i) to reduce the large uncertainties concerning the estimates of CO2, N2O and CH4 fluxes to and from grassland plots under different climatic conditions and assess their global warming potential, ii) to measure net greenhouse gas (GHG) fluxes for different management which reflect potential mitigation options, iii) to construct a model of the controlling processes to quantify the net fluxes and to evaluate mitigation scenarios by up-scaling to a European level