Advanced InSAR Tropospheric Corrections from Global Atmospheric Models that Incorporate Spatial Stochastic Properties of the Troposphere

Schemes generating cryptographic keys from arrays of pre-formed Resistive Random Access (ReRAM) cells, called memristors, can also be used for the design of fast true random number generators (TRNG’s) of exceptional quality, while consuming low levels of electric power. Natural randomness is formed in the large stochastic cell-to-cell variations in resistance values at low injected currents in the pre-formed range. The proposed TRNG scheme can be designed with three interconnected blocks: (i) a pseudo-random number generator that acts as an extended output function to generate a stream of addresses pointing randomly at the array of ReRAM cells; (ii) a method to read the resistance values of these cells with a low injected current, and to convert the values into a stream of random bits; and, if needed, (iii) a method to further enhance the randomness of this stream such as mathematical, Boolean, and cryptographic algorithms. The natural stochastic properties of the ReRAM cells in the pre-forming range, at low currents, have been analyzed and demonstrated by measuring a statistically significant number of cells. Various implementations of the TRNGs with ReRAM arrays are presented in this paper.

Download Full-text

d4PDF: large-ensemble and high-resolution climate simulations for global warming risk assessment

Progress in Earth and Planetary Science ◽

10.1186/s40645-020-00367-7 ◽

2020 ◽

Vol 7 (1) ◽

Author(s):

Masayoshi Ishii ◽

Nobuhito Mori

Keyword(s):

Risk Assessment ◽

Global Warming ◽

High Resolution ◽

Climate Changes ◽

Future Climate ◽

Atmospheric Models ◽

Large Ensemble ◽

Past Climate ◽

The Past ◽

Climate Simulations

Abstract A large-ensemble climate simulation database, which is known as the database for policy decision-making for future climate changes (d4PDF), was designed for climate change risk assessments. Since the completion of the first set of climate simulations in 2015, the database has been growing continuously. It contains the results of ensemble simulations conducted over a total of thousands years respectively for past and future climates using high-resolution global (60 km horizontal mesh) and regional (20 km mesh) atmospheric models. Several sets of future climate simulations are available, in which global mean surface air temperatures are forced to be higher by 4 K, 2 K, and 1.5 K relative to preindustrial levels. Nonwarming past climate simulations are incorporated in d4PDF along with the past climate simulations. The total data volume is approximately 2 petabytes. The atmospheric models satisfactorily simulate the past climate in terms of climatology, natural variations, and extreme events such as heavy precipitation and tropical cyclones. In addition, data users can obtain statistically significant changes in mean states or weather and climate extremes of interest between the past and future climates via a simple arithmetic computation without any statistical assumptions. The database is helpful in understanding future changes in climate states and in attributing past climate events to global warming. Impact assessment studies for climate changes have concurrently been performed in various research areas such as natural hazard, hydrology, civil engineering, agriculture, health, and insurance. The database has now become essential for promoting climate and risk assessment studies and for devising climate adaptation policies. Moreover, it has helped in establishing an interdisciplinary research community on global warming across Japan.

Download Full-text

Timing attacks and local timing attacks against Barrett’s modular multiplication algorithm

Journal of Cryptographic Engineering ◽

10.1007/s13389-020-00254-3 ◽

2021 ◽

Author(s):

Johannes Mittmann ◽

Werner Schindler

Keyword(s):

Side Channel ◽

Modular Exponentiation ◽

Modular Multiplication ◽

Multiplication Algorithm ◽

Diffie Hellman ◽

Mathematical Difficulties ◽

Execution Times ◽

Stochastic Properties ◽

Timing Attacks ◽

Theoretical Results

AbstractMontgomery’s and Barrett’s modular multiplication algorithms are widely used in modular exponentiation algorithms, e.g. to compute RSA or ECC operations. While Montgomery’s multiplication algorithm has been studied extensively in the literature and many side-channel attacks have been detected, to our best knowledge no thorough analysis exists for Barrett’s multiplication algorithm. This article closes this gap. For both Montgomery’s and Barrett’s multiplication algorithm, differences of the execution times are caused by conditional integer subtractions, so-called extra reductions. Barrett’s multiplication algorithm allows even two extra reductions, and this feature increases the mathematical difficulties significantly. We formulate and analyse a two-dimensional Markov process, from which we deduce relevant stochastic properties of Barrett’s multiplication algorithm within modular exponentiation algorithms. This allows to transfer the timing attacks and local timing attacks (where a second side-channel attack exhibits the execution times of the particular modular squarings and multiplications) on Montgomery’s multiplication algorithm to attacks on Barrett’s algorithm. However, there are also differences. Barrett’s multiplication algorithm requires additional attack substeps, and the attack efficiency is much more sensitive to variations of the parameters. We treat timing attacks on RSA with CRT, on RSA without CRT, and on Diffie–Hellman, as well as local timing attacks against these algorithms in the presence of basis blinding. Experiments confirm our theoretical results.

Download Full-text