Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Concept

Exponentiation by squaring

Related publications (7)

Optimal lower bounds on hitting probabilities for stochastic heat equations in spatial dimension k >= 1

Robert Dalang, Fei Pu

We establish a sharp estimate on the negative moments of the smallest eigenvalue of the Malliavin matrix gamma z of Z := (u(s, y), u(t , x) - u(s, y)), where u is the solution to a system of d non-linear stochastic heat equations in spatial dimension k >= ...

UNIV WASHINGTON, DEPT MATHEMATICS2020

Staggered flux state for rectangular-lattice spin-1/2 Heisenberg antiferromagnets

Henrik Moodysson Rønnow, Dmitri Ivanov, Bastien Dalla Piazza, Noore Elahi Shaik

We investigate the spin-1/2 Heisenberg model on a rectangular lattice, using the Gutzwiller projected variational wave function known as the staggered flux state. Using Monte Carlo techniques, the variational parameters and instantaneous spin-spin correlat ...

AMER PHYSICAL SOC2020

Efficient Fail-Stop Signatures from the Factoring Assumption

Khaled Ouafi, Atefeh Mashatan

In this paper, we revisit the construction of fail-stop signatures from the factoring assumption. These signatures were originally proposed to provide information-theoretic-based security against forgeries. In contrast to classical signature schemes, in wh ...

Springer2011

Time-Intensity Superposition for Photoinitiated Polymerization of Fluorinated and Hyperbranched Acrylate Nanocomposites

Jan-Anders Edvin Maansson, Yves Leterrier, Sara Dalle Vacche, Valérie Geiser

The validity of the time-intensity superposition principle for the photoinitiated polymerization of nanocomposites based on a monofunctional fluorinated acrylate and on a multifunctional hyperbranched polyether acrylate was investigated in this work. Maste ...

2010

Faster Integer Multiplication

For more than 35 years, the fastest known method for integer multiplication has been the Schonhage-Strassen algorithm running in time O(n log n log log n). Under certain restrictive conditions, there is a corresponding Omega(n log n) lower bound. All this ...

2009

Bipartite modular multiplication method

This paper proposes a new modular multiplication method that uses Montgomery residues defined by a modulus M and a Montgomery radix R whose value is less than the modulus M. This condition enables the operand multiplier to be split into two parts that can ...

2008

Discrete logarithm variants of VSH

Arjen Lenstra, Martijn Stam

Recent attacks on standardised hash functions such as SHA1 have reawakened interest in design strategies based on techniques common in provable security. In presenting the VSH hash function, a design based on RSA-like modular exponentiation, the authors in ...

2006