Elliptic curve cryptography: The serpentine course of a paradigm shift

Text

Over a period of sixteen years elliptic curve cryptography went from being an approach that many people mistrusted or misunderstood to being a public key technology that enjoys almost unquestioned acceptance. We describe the sometimes surprising twists and turns in this paradigm shift, and compare this story with the commonly accepted Ideal Model of how research and development function in cryptography. We also discuss to what extent the ideas in the literature on “social construction of technology” can contribute to a better understanding of this history.

Video

For a video summary of this paper, please visit http://www.youtube.com/watch?v=HHFFvfDoTK4.     

Existence of Hopf subalgebras of GK-dimension two

Let H be a pointed Hopf algebra over an algebraically closed field of characteristic zero. If H is a domain with finite Gelfand-Kirillov dimension greater than or equal to two, then H contains a Hopf subalgebra of Gelfand-Kirillov dimension two.     

A preconditioning approach to the pagerank computation problem

Some spectral properties of the transition matrix of an oriented graph indicate the preconditioning of Euler-Richardson (ER) iterative scheme as a good way to compute efficiently the vertexrank vector associated with such graph. We choose the preconditioner from an algebra U of matrices, thereby obtaining an ER_U method, and we observe that ER_U can outperform ER in terms of rate of convergence. The proposed preconditioner can be updated at a very low cost whenever the graph changes, as is the case when it represents a generic set of information. The particular U utilized requires a surplus of operations per step and memory allocations, which make ER_U superior to ER for not too wide graphs. However, the observed high improvement in convergence rate obtained by preconditioning and the general theory developed, are a reason for investigating different choices of U, more efficient for huge graphs.     

Relative T -Injective Modules and Relative T -Flat Modules

Let T be a Wakamatsu tilting module. A module M is called (n, T)-copure injective (resp. (n, T)-copure flat) if ɛ _T ¹ (N, M) = 0 (resp. Γ₁ ^T (N, M) = 0) for any module N with T-injective dimension at most n (see Definition 2.2). In this paper, it is shown that M is (n, T)-copure injective if and only if M is the kernel of an I _n (T)-precover f: A → B with A ∈ Prod T. Also, some results on Prod T-syzygies are presented. For instance, it is shown that every nth Prod T-syzygy of every module, generated by T, is (n, T)-copure injective.     

On the stability of a domain-wall brane model

We establish stability and nonstability results for a domain-wall brane model arising in classical field theory. In particular, we show the nonexistence of nontrivial bounded solutions on the real line for a coupled pair of parameter dependent linear second order ordinary differential equations for an open set of those parameters. Moreover, we establish the existence of nontrivial solutions for a hypersurface of the parameters. We use Fredholm theory for compact linear operators combined with the Lyapunov-Schmidt method to prove our results. The model is stable, respectively unstable, for those parameters for which the coupled system does not, respectively does, have nontrivial solutions.     

The effect of the iterative triple and quadruple cluster amplitudes on the adiabatic potential curve in the coupled cluster calculations of the ground electronic state of the Yb dimer

The dissociation energy, equilibrium internuclear distance, and spectroscopic constants for the ¹Σ ground state of the Yb₂ molecule are calculated. The relativistic effects are introduced through generalized relativistic effective core potentials with very high precision. The scalar relativistic coupled cluster method particularly well suited for closed‐shell van der Waals systems is used for the correlation treatment. Extensive generalized correlation basis sets were constructed and used. The relatively small corrections for high‐order cluster amplitudes and spin—orbit interactions are taken into account using smaller basis sets and the spin—orbit density functional theory. © 2010 Wiley Periodicals, Inc. Int J Quantum Chem, 2011     

Lie algebras associated to systems of Dyson–Schwinger equations

We consider systems of combinatorial Dyson–Schwinger equations in the Connes–Kreimer Hopf algebra HI of rooted trees decorated by a set I. Let H(S) be the subalgebra of HI generated by the homogeneous components of the unique solution of this system. If it is a Hopf subalgebra, we describe it as the dual of the enveloping algebra of a Lie algebra g(S) of one of the following types:

• 1. 

  g(S) is an associative algebra of paths associated to a certain oriented graph.

• 2. 

  Or g(S) is an iterated extension of the Faà di Bruno Lie algebra.

• 3. 

  Or g(S) is an iterated extension of an infinite-dimensional abelian Lie algebra.

We also describe the character groups of H(S).     

Linear maps between C*-algebras that are *-homomorphisms at a fixed point

Let A and B be C*-algebras. A linear map T : A → B is said to be a *-homomorphism at an element z ∈ A if ab* = z in A implies T (ab*) = T (a)T (b)* = T (z), and c*d = z in A gives T (c*d) = T (c)*T (d) = T (z). Assuming that A is unital, we prove that every linear map T : A → B which is a *-homomorphism at the unit of A is a Jordan *-homomorphism. If A is simple and infinite, then we establish that a linear map T : A → B is a *-homomorphism if and only if T is a *-homomorphism at the unit of A. For a general unital C*-algebra A and a linear map T : A → B, we prove that T is a *-homomorphism if, and only if, T is a *-homomorphism at 0 and at 1. Actually if p is a non-zero projection in A, and T is a ^?-homomorphism at p and at 1 ? p, then we prove that T is a Jordan *-homomorphism. We also study bounded linear maps that are *-homomorphisms at a unitary element in A.     

Computing complex and real tropical curves using monodromy

Tropical varieties capture combinatorial information about how coordinates of points in a classical variety approach zero or infinity. We present algorithms for computing the rays of a complex and real tropical curve defined by polynomials with constant coefficients. These algorithms rely on homotopy continuation, monodromy loops, and Cauchy integrals. Several examples are presented which are computed using an implementation that builds on the numerical algebraic geometry software Bertini.     

On Eisenstein polynomials and zeta polynomials

Eisenstein polynomials, which were defined by Oura, are analogues of the concept of an Eisenstein series. Oura conjectured that there exist some analogous properties between Eisenstein series and Eisenstein polynomials. In this paper, we provide new analogous properties of Eisenstein polynomials and zeta polynomials. These properties are finite analogies of certain properties of Eisenstein series.