Constructive and destructive use of compilers in elliptic curve cryptography

Although cryptographic software implementation is often performed by expert programmers, the range of performance and security driven options, as well as more mundane software engineering issues, still make it a challenge. The use of domain specific language and compiler techniques to assist in description and optimisation of cryptographic software is an interesting research challenge. In this paper we investigate two aspects of such techniques, focusing on Elliptic Curve Cryptography (ECC) in particular. Our constructive results show that a suitable language allows description of ECC based software in a manner close to the original mathematics; the corresponding compiler allows automatic production of an executable whose performance is competitive with that of a hand-optimised implementation. In contrast, we study the worrying potential for naïve compiler driven optimisation to render cryptographic software insecure. Both aspects of our work are set within the context of CACE, an ongoing EU funded project on this general topic

Persistence of a Continuous Stochastic Process with Discrete-Time Sampling: Non-Markov Processes

We consider the problem of `discrete-time persistence', which deals with the zero-crossings of a continuous stochastic process, X(T), measured at discrete times, T = n(\Delta T). For a Gaussian Stationary Process the persistence (no crossing) probability decays as exp(-\theta_D T) = [\rho(a)]^n for large n, where a = \exp[-(\Delta T)/2], and the discrete persistence exponent, \theta_D, is given by \theta_D = \ln(\rho)/2\ln(a). Using the `Independent Interval Approximation', we show how \theta_D varies with (\Delta T) for small (\Delta T) and conclude that experimental measurements of persistence for smooth processes, such as diffusion, are less sensitive to the effects of discrete sampling than measurements of a randomly accelerated particle or random walker. We extend the matrix method developed by us previously [Phys. Rev. E 64, 015151(R) (2001)] to determine \rho(a) for a two-dimensional random walk and the one-dimensional random acceleration problem. We also consider `alternating persistence', which corresponds to a < 0, and calculate \rho(a) for this case.Comment: 14 pages plus 8 figure

Persistence in a Stationary Time-series

We study the persistence in a class of continuous stochastic processes that are stationary only under integer shifts of time. We show that under certain conditions, the persistence of such a continuous process reduces to the persistence of a corresponding discrete sequence obtained from the measurement of the process only at integer times. We then construct a specific sequence for which the persistence can be computed even though the sequence is non-Markovian. We show that this may be considered as a limiting case of persistence in the diffusion process on a hierarchical lattice.Comment: 8 pages revte

The Australian dingo is an early offshoot of modern breed dogs

Dogs are uniquely associated with human dispersal and bring transformational insight into the domestication process. Dingoes represent an intriguing case within canine evolution being geographically isolated for thousands of years. Here, we present a high-quality de novo assembly of a pure dingo (CanFam_DDS). We identified large chromosomal differences relative to the current dog reference (CanFam3.1) and confirmed no expanded pancreatic amylase gene as found in breed dogs. Phylogenetic analyses using variant pairwise matrices show that the dingo is distinct from five breed dogs with 100% bootstrap support when using Greenland wolf as the outgroup. Functionally, we observe differences in methylation patterns between the dingo and German shepherd dog genomes and differences in serum biochemistry and microbiome makeup. Our results suggest that distinct demographic and environmental conditions have shaped the dingo genome. In contrast, artificial human selection has likely shaped the genomes of domestic breed dogs after divergence from the dingo

Neel probability and spin correlations in some nonmagnetic and nondegenerate states of hexanuclear antiferromagnetic ring Fe6: Application of algebraic combinatorics to finite Heisenberg spin systems

The spin correlations \omega^z_r, r=1,2,3, and the probability p_N$ of finding a system in the Neel state for the antiferromagnetic ring Fe(III)6 (the so-called `small ferric wheel') are calculated. States with magnetization M=0, total spin 0<=S<=15 and labeled by two (out of four) one-dimensional irreducible representations (irreps) of the point symmetry group D_6 are taken into account. This choice follows from importance of these irreps in analyzing low-lying states in each S-multiplet. Taking into account the Clebsch--Gordan coefficients for coupling total spins of sublattices (SA=SB=15/2) the global Neel probability p*_N can be determined. Dependencies of these quantities on state energy (per bond and in the units of exchange integral J) and the total spin S are analyzed. Providing we have determined p_N(S) etc. for other antiferromagnetic rings (Fe10, for instance) we could try to approximate results for the largest synthesized ferric wheel Fe18. Since thermodynamic properties of Fe6 have been investigated recently, in the present considerations they are not discussed, but only used to verify obtained values of eigenenergies. Numerical results re calculated with high precision using two main tools: (i) thorough analysis of symmetry properties including methods of algebraic combinatorics and (ii) multiple precision arithmetic library GMP. The system considered yields more than 45 thousands basic states (the so-called Ising configurations), but application of the method proposed reduces this problem to 20-dimensional eigenproblem for the ground state (S=0). The largest eigenproblem has to be solved for S=4; its dimension is 60. These two facts (high precision and small resultant eigenproblems) confirm efficiency and usefulness of such an approach, so it is briefly discussed here.Comment: 13 pages, 7 figs, 5 tabs, revtex

Aligning simulation models: A case study and results

This paper develops the concepts and methods of a process we will call “alignment of computational models” or “docking” for short. Alignment is needed to determine whether two models can produce the same results, which in turn is the basis for critical experiments and for tests of whether one model can subsume another. We illustrate our concepts and methods using as a target a model of cultural transmission built by Axelrod. For comparison we use the Sugarscape model developed by Epstein and Axtell.Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/44707/1/10588_2005_Article_BF01299065.pd