Ground state and glass transition of the RNA secondary structure

RNA molecules form a sequence-specific self-pairing pattern at low temperatures. We analyze this problem using a random pairing energy model as well as a random sequence model that includes a base stacking energy in favor of helix propagation. The free energy cost for separating a chain into two equal halves offers a quantitative measure of sequence specific pairing. In the low temperature glass phase, this quantity grows quadratically with the logarithm of the chain length, but it switches to a linear behavior of entropic origin in the high temperature molten phase. Transition between the two phases is continuous, with characteristics that resemble those of a disordered elastic manifold in two dimensions. For designed sequences, however, a power-law distribution of pairing energies on a coarse-grained level may be more appropriate. Extreme value statistics arguments then predict a power-law growth of the free energy cost to break a chain, in agreement with numerical simulations. Interestingly, the distribution of pairing distances in the ground state secondary structure follows a remarkable power-law with an exponent -4/3, independent of the specific assumptions for the base pairing energies

Developing an Automatic Generation Tool for Cryptographic Pairing Functions

Pairing-Based Cryptography is receiving steadily more attention from industry, mainly because of the increasing interest in Identity-Based protocols. Although there are plenty of applications, efficiently implementing the pairing functions is often difficult as it requires more knowledge than previous cryptographic primitives. The author presents a tool for automatically generating optimized code for the pairing functions which can be used in the construction of such cryptographic protocols. In the following pages I present my work done on the construction of pairing function code, its optimizations and how their construction can be automated to ease the work of the protocol implementer. Based on the user requirements and the security level, the created cryptographic compiler chooses and constructs the appropriate elliptic curve. It identifies the supported pairing function: the Tate, ate, R-ate or pairing lattice/optimal pairing, and its optimized parameters. Using artificial intelligence algorithms, it generates optimized code for the final exponentiation and for hashing a point to the required group using the parametrisation of the chosen family of curves. Support for several multi-precision libraries has been incorporated: Magma, MIRACL and RELIC are already included, but more are possible

Measurement of masses in the [Formula: see text] system by kinematic endpoints in pp collisions at [Formula: see text].

A simultaneous measurement of the top-quark, W-boson, and neutrino masses is reported for [Formula: see text] events selected in the dilepton final state from a data sample corresponding to an integrated luminosity of 5.0 fb-1 collected by the CMS experiment in pp collisions at [Formula: see text]. The analysis is based on endpoint determinations in kinematic distributions. When the neutrino and W-boson masses are constrained to their world-average values, a top-quark mass value of [Formula: see text] is obtained. When such constraints are not used, the three particle masses are obtained in a simultaneous fit. In this unconstrained mode the study serves as a test of mass determination methods that may be used in beyond standard model physics scenarios where several masses in a decay chain may be unknown and undetected particles lead to underconstrained kinematics

Quantitative Small Subgraph Conditioning

We revisit the method of small subgraph conditioning, used to establish that random regular graphs are Hamiltonian a.a.s. We refine this method using new technical machinery for random $d$-regular graphs on $n$ vertices that hold not just asymptotically, but for any values of $d$ and $n$. This lets us estimate how quickly the probability of containing a Hamiltonian cycle converges to 1, and it produces quantitative contiguity results between different models of random regular graphs. These results hold with $d$ held fixed or growing to infinity with $n$. As additional applications, we establish the distributional convergence of the number of Hamiltonian cycles when $d$ grows slowly to infinity, and we prove that the number of Hamiltonian cycles can be approximately computed from the graph's eigenvalues for almost all regular graphs.Comment: 59 pages, 5 figures; minor changes for clarit

Cryptographic Pairings: Efficiency and DLP security

This thesis studies two important aspects of the use of pairings in cryptography, efficient algorithms and security. Pairings are very useful tools in cryptography, originally used for the cryptanalysis of elliptic curve cryptography, they are now used in key exchange protocols, signature schemes and Identity-based cryptography. This thesis comprises of two parts: Security and Efficient Algorithms. In Part I: Security, the security of pairing-based protocols is considered, with a thorough examination of the Discrete Logarithm Problem (DLP) as it occurs in PBC. Results on the relationship between the two instances of the DLP will be presented along with a discussion about the appropriate selection of parameters to ensure particular security level. In Part II: Efficient Algorithms, some of the computational issues which arise when using pairings in cryptography are addressed. Pairings can be computationally expensive, so the Pairing-Based Cryptography (PBC) research community is constantly striving to find computational improvements for all aspects of protocols using pairings. The improvements given in this section contribute towards more efficient methods for the computation of pairings, and increase the efficiency of operations necessary in some pairing-based protocol