Efficient Decomposition of Dense Matrices over GF(2)

In this work we describe an efficient implementation of a hierarchy of algorithms for the decomposition of dense matrices over the field with two elements (GF(2)). Matrix decomposition is an essential building block for solving dense systems of linear and non-linear equations and thus much research has been devoted to improve the asymptotic complexity of such algorithms. In this work we discuss an implementation of both well-known and improved algorithms in the M4RI library. The focus of our discussion is on a new variant of the M4RI algorithm - denoted MMPF in this work -- which allows for considerable performance gains in practice when compared to the previously fastest implementation. We provide performance figures on x86_64 CPUs to demonstrate the viability of our approach

Efficient Dense Gaussian Elimination over the Finite Field with Two Elements

In this work we describe an efficient implementation of a hierarchy of algorithms for Gaussian elimination upon dense matrices over the field with two elements. We discuss both well-known and new algorithms as well as our implementations in the M4RI library, which has been adopted into Sage. The focus of our discussion is a block iterative algorithm for PLE decomposition which is inspired by the M4RI algorithm. The implementation presented in this work provides considerable performance gains in practice when compared to the previously fastest implementation. We provide performance figures on x86_64 CPUs to demonstrate the alacrity of our approach

The M4RIE library for dense linear algebra over small fields with even characteristic

International audienceIn this work, we present the M4RIE library which implements efficient algorithms for linear algebra with dense matrices over GF(2^e) for 2 <= 2 <= 10. As the name of the library indicates, it makes heavy use of the M4RI library both directly (i.e., by calling it) and indirectly (i.e., by using its concepts). We provide an open-source GPLv2+ C library for efficient linear algebra over GF(2^e) for e small. In this library we implemented an idea due to Bradshaw and Boothby which reduces matrix multiplication over GF(p^k) to a series of matrix multiplications over GF(p). Furthermore, we propose a caching technique - Newton-John tables - to avoid finite field multiplications which is inspired by Kronrod's method ("M4RM") for matrix multiplication over GF(2). Using these two techniques we provide asymptotically fast triangular solving with matrices (TRSM) and PLE-based Gaussian elimination. As a result, we are able to significantly improve upon the state of the art in dense linear algebra over GF(2^e) with 2 <= e <= 10.See englis

Implementing Candidate Graded Encoding Schemes from Ideal Lattices

International audienceMultilinear maps have become popular tools for designing cryptographic schemes since a first approximate realisation candidate was proposed by Garg, Gentry and Halevi (GGH). This construction was later improved by Langlois, Stehlé and Steinfeld who proposed GGHLite which offers smaller parameter sizes. In this work, we provide the first implementation of such approximate multilinear maps based on ideal lattices. Implementing GGH-like schemes naively would not allow instantiating it for non-trivial parameter sizes. We hence propose a strategy which reduces parameter sizes further and several technical improvements to allow for an efficient implementation. In particular, since finding a prime ideal when generating instances is an expensive operation, we show how we can drop this requirement. We also propose algorithms and implementations for sampling from discrete Gaussians, for inverting in some Cyclotomic number fields and for computing norms of ideals in some Cyclotomic number rings. Due to our improvements we were able to compute a multilinear jigsaw puzzle for κ " 52 (resp. κ " 38) and λ " 52 (resp. λ " 80)

Parameterization for subgrid-scale motion of ice-shelf calving fronts

A parameterization for the motion of ice-shelf fronts on a Cartesian grid in finite-difference land-ice models is presented. The scheme prevents artificial thinning of the ice shelf at its edge, which occurs due to the finite resolution of the model. The intuitive numerical implementation diminishes numerical dispersion at the ice front and enables the application of physical boundary conditions to improve the calculation of stress and velocity fields throughout the ice-sheet-shelf system. Numerical properties of this subgrid modification are assessed in the Potsdam Parallel Ice Sheet Model (PISM-PIK) for different geometries in one and two horizontal dimensions and are verified against an analytical solution in a flow-line setup

Parameterization for subgrid-scale motion of ice-shelf calving fronts

In order to explore the response of the Greenland ice sheet (GIS) to climate change on long (centennial to multi-millennial) time scales, a regional energy-moisture balance model has been developed. This model simulates seasonal variations of temperature and precipitation over Greenland and explicitly accounts for elevation and albedo feedbacks. From these fields, the annual mean surface temperature and surface mass balance can be determined and used to force an ice sheet model. The melt component of the surface mass balance is computed here using both a positive degree day approach and a more physically-based alternative that includes insolation and albedo explicitly. As a validation of the climate model, we first simulated temperature and precipitation over Greenland for the prescribed, present-day topography. Our simulated climatology compares well to observations and does not differ significantly from that of a simple parameterization used in many previous simulations. Furthermore, the calculated surface mass balance using both melt schemes falls within the range of recent regional climate model results. For a prescribed, ice-free state, the differences in simulated climatology between the regional energy-moisture balance model and the simple parameterization become significant, with our model showing much stronger summer warming. When coupled to a three-dimensional ice sheet model and initialized with present-day conditions, the two melt schemes both allow realistic simulations of the present-day GIS

Kinematic first-order calving law implies potential for abrupt ice-shelf retreat

Recently observed large-scale disintegration of Antarctic ice shelves has moved their fronts closer towards grounded ice. In response, ice-sheet discharge into the ocean has accelerated, contributing to global sea-level rise and emphasizing the importance of calving-front dynamics. The position of the ice front strongly influences the stress field within the entire sheet-shelf-system and thereby the mass flow across the grounding line. While theories for an advance of the ice-front are readily available, no general rule exists for its retreat, making it difficult to incorporate the retreat in predictive models. Here we extract the first-order large-scale kinematic contribution to calving which is consistent with large-scale observation. We emphasize that the proposed equation does not constitute a comprehensive calving law but represents the first-order kinematic contribution which can and should be complemented by higher order contributions as well as the influence of potentially heterogeneous material properties of the ice. When applied as a calving law, the equation naturally incorporates the stabilizing effect of pinning points and inhibits ice shelf growth outside of embayments. It depends only on local ice properties which are, however, determined by the full topography of the ice shelf. In numerical simulations the parameterization reproduces multiple stable fronts as observed for the Larsen A and B Ice Shelves including abrupt transitions between them which may be caused by localized ice weaknesses. We also find multiple stable states of the Ross Ice Shelf at the gateway of the West Antarctic Ice Sheet with back stresses onto the sheet reduced by up to 90 % compared to the present state

Inflationary Cosmological Perturbations of Quantum-Mechanical Origin

This review article aims at presenting the theory of inflation. We first describe the background spacetime behavior during the slow-roll phase and analyze how inflation ends and the Universe reheats. Then, we present the theory of cosmological perturbations with special emphasis on their behavior during inflation. In particular, we discuss the quantum-mechanical nature of the fluctuations and show how the uncertainty principle fixes the amplitude of the perturbations. In a next step, we calculate the inflationary power spectra in the slow-roll approximation and compare these theoretical predictions to the recent high accuracy measurements of the Cosmic Microwave Background radiation (CMBR) anisotropy. We show how these data already constrain the underlying inflationary high energy physics. Finally, we conclude with some speculations about the trans-Planckian problem, arguing that this issue could allow us to open a window on physical phenomena which have never been probed so far.Comment: Review Article, 47 pages, 3 figures. Lectures given at the 40th Karpacz Winter School on Theoretical Physics (Poland, Feb. 2004), submitted to Lecture Notes in Physic

Multilinear Maps from Obfuscation

International audienceWe provide constructions of multilinear groups equipped with natural hard problems from in-distinguishability obfuscation, homomorphic encryption, and NIZKs. This complements known results on the constructions of indistinguishability obfuscators from multilinear maps in the reverse direction. We provide two distinct, but closely related constructions and show that multilinear analogues of the DDH assumption hold for them. Our first construction is symmetric and comes with a κ-linear map e : G κ −→ G T for prime-order groups G and G T. To establish the hardness of the κ-linear DDH problem, we rely on the existence of a base group for which the (κ − 1)-strong DDH assumption holds. Our second construction is for the asymmetric setting, where e : G 1 × · · · × G κ −→ G T for a collection of κ + 1 prime-order groups G i and G T , and relies only on the standard DDH assumption in its base group. In both constructions the linearity κ can be set to any arbitrary but a priori fixed polynomial value in the security parameter. We rely on a number of powerful tools in our constructions: (probabilistic) indistinguishability obfuscation, dual-mode NIZK proof systems (with perfect soundness, witness indistinguishability and zero knowledge), and additively homomorphic encryption for the group Z + N. At a high level, we enable " bootstrapping " multilinear assumptions from their simpler counterparts in standard cryptographic groups, and show the equivalence of IO and multilinear maps under the existence of the aforementioned primitives