L'Arc et son bassin versant.

Cet article décrit successivement la ripisylve de l'Arc dans les Bouches-du-Rhône, ces rôles, son entretien. C'est un bon exemple de la prise en compte des différents enjeux liés à la ripisylve, dans la gestion d'un cours d'eau méditerranéen

On the Complexity of Solving Quadratic Boolean Systems

A fundamental problem in computer science is to find all the common zeroes of $m$ quadratic polynomials in $n$ unknowns over $\mathbb{F}_2$. The cryptanalysis of several modern ciphers reduces to this problem. Up to now, the best complexity bound was reached by an exhaustive search in $4\log_2 n\,2^n$ operations. We give an algorithm that reduces the problem to a combination of exhaustive search and sparse linear algebra. This algorithm has several variants depending on the method used for the linear algebra step. Under precise algebraic assumptions on the input system, we show that the deterministic variant of our algorithm has complexity bounded by $O(2^{0.841n})$ when $m=n$, while a probabilistic variant of the Las Vegas type has expected complexity $O(2^{0.792n})$. Experiments on random systems show that the algebraic assumptions are satisfied with probability very close to~1. We also give a rough estimate for the actual threshold between our method and exhaustive search, which is as low as~200, and thus very relevant for cryptographic applications.Comment: 25 page

«Le bio doit être plus accessible!»

Raphaël Charles revient sur l’évolution du Département Suisse Romande du FiBL qu’il dirige depuis 2016. Le FiBL s’est depuis imposé dans le paysage technique et institutionnel agricole

«Bio deve essere accessibile a tutti»

Raphaël Charles ripercorre lo sviluppo del dipartimento Svizzera romanda del FiBL che dirige dal 2016. Entro pochi anni l’istituzione si è affermata un partner competente per gli esperti

«Bio muss für alle zugänglich sein»

Raphaël Charles blickt zurück auf die Entwicklung des Departements Westschweiz des FiBL, das er seit 2016 leitet. Innerhalb weniger Jahre hat sich das FiBL in der Romandie als kompetenter Partner etabliert

Understanding Phase Shifting Equivalent Keys and Exhaustive Search

Recent articles~\cite{kucuk,ckp08,isobe,cryptoeprint:2008:128} introduce the concept of phase shifting equivalent keys in stream ciphers, and exploit this concept in order to mount attacks on some specific ciphers. The idea behind phase shifting equivalent keys is that, for many ciphers, each internal state can be considered as the result of an injection of a key and initialization vector. This enables speeding up the standard exhaustive search algorithm among the $2^n$ possible keys by decreasing the constant factor of $2^n$ in the time complexity of the algorithm. However, this has erroneously been stated in~\cite{isobe,cryptoeprint:2008:128} as decreasing the complexity of the algorithm below $2^n$. In this note, we show why this type of attacks, using phase shifting equivalent keys to improve exhaustive key search, can never reach time complexity below $2^n$, where $2^n$ is the size of the key space

Hydroxyferroroméite, a new secondary weathering mineral from Oms, France

Hydroxyferroroméite, ideally (Fe2+ 1.5[]0.5)Sb5+ 2O6(OH), is a new secondary mineral from the Correc d'en Llinassos, Oms, Pyrénées-Orientales Department, France. Hydroxyferroroméite occurs as yellow to yellow-brown powdery boxwork replacements up to about 50μm across after tetrahedrite in a siderite–quartz matrix. No distinct crystals have been observed. The empirical formula (based on 7 (O + OH) per formula unit, pfu) is (Fe2+ 1.07Cu2+ 0.50Zn0.03Sr0.03Ca 0.01[]0.36)Σ2 (Sb5+ 1.88Si0.09Al0.02As0.01)Σ2 O6 ((OH)0.86 O0.14). X-ray photoelectron spectroscopy was used to determine the valence states of Sb, Fe and Cu. Hydroxyferroroméite crystallises in the space group Fd3 m with the pyrochlore structure and hence is a new Fe2+ -dominant member of the roméite group of the pyrochlore supergroup. It has the unit-cell parameters: a = 10.25(3) Å, V = 1077(6) Å3 and Z = 8. A model, based on bond-valence theory, for incorporation of the small Fe2+ cation into a displaced variant of the A site of the pyrochlore structure is proposed.The attached document is the author(’s’) final accepted/submitted version of the journal article. You are advised to consult the publisher’s version if you wish to cite from it

Fast Near Collision Attack on the Grain v1 Stream Cipher

Modern stream ciphers often adopt a large internal state to resist various attacks, where the cryptanalysts have to deal with a large number of variables when mounting state recovery attacks. In this paper, we propose a general new cryptanalytic method on stream ciphers, called fast near collision attack, to address this situation. It combines a near collision property with the divide-and-conquer strategy so that only subsets of the internal state, associated with different keystream vectors, are recovered first and merged carefully later to retrieve the full large internal state. A self-contained method is introduced and improved to derive the target subset of the internal state from the partial state difference efficiently. As an application, we propose a new key recovery attack on Grain v1, one of the $7$ finalists selected by the eSTREAM project, in the single-key setting. Both the pre-computation and the online phases are tailored according to its internal structure, to provide an attack for any fixed IV in $2^{75.7}$ cipher ticks after the pre-computation of $2^{8.1}$ cipher ticks, given $2^{28}$-bit memory and about $2^{19}$ keystream bits. Practical experiments on Grain v1 itself whenever possible and on a 80-bit reduced version confirmed our results

Improving the Performance of the SYND Stream Cipher

International audience. In 2007, Gaborit et al. proposed the stream cipher SYND as an improvement of the pseudo random number generator due to Fischer and Stern. This work shows how to improve considerably the e ciency the SYND cipher without using the so-called regular encoding and without compromising the security of the modi ed SYND stream cipher. Our proposal, called XSYND, uses a generic state transformation which is reducible to the Regular Syndrome Decoding problem (RSD), but has better computational characteristics than the regular encoding. A rst implementation shows that XSYND runs much faster than SYND for a comparative security level (being more than three times faster for a security level of 128 bits, and more than 6 times faster for 400-bit security), though it is still only half as fast as AES in counter mode. Parallel computation may yet improve the speed of our proposal, and we leave it as future research to improve the e ciency of our implementation