53,372 research outputs found
The implementation of cubic public keys based on a new family of algebraic graphs
Families of edge transitive algebraic graphs defined over finite commutative rings were used for the development of stream ciphers, public key cryptosystems and key exchange protocols. We present the results of the first implementation of a public key algorithm based on the family of algebraic graphs, which are not edge transitive. The absence of an edge transitive group of symmetries means that the algorithm can not be described in group theoretical terms. We hope that it licates cryptanalysis of the algorithm. We discuss the connections between the security of algorithms and the discrete logarithm problem.The plainspace of the algorithm is Kn, where K is the chosen commutative ring. The graph theoretical encryption corresponds to walk on the bipartite graph with the partition sets which are isomorphic to Kn. We conjugate the chosen graph based encryption map, which is a composition of several elementary cubical polynomial automorphisms of a free module Kn with special invertible affine transformation of Kn. Finally we compute symbolically the corresponding cubic public map g of Kn onto Kn. We evaluate time for the generation of g, and the number of monomial expression in the list of corresponding public rules
Cubic and quartic transformations of the sixth Painleve equation in terms of Riemann-Hilbert correspondence
A starting point of this paper is a classification of quadratic polynomial
transformations of the monodromy manifold for the 2x2 isomonodromic Fuchsian
systems associated to the Painleve VI equation. Up to birational automorphisms
of the monodromy manifold, we find three transformations. Two of them are
identified as the action of known quadratic or quartic transformations of the
Painleve VI equation. The third transformation of the monodromy manifold gives
a new transformation of degree 3 of Picard's solutions of Painleve VI.Comment: Added: classification of quadratic transformations of the Monodromy
manifold; new cubic (and quartic) transformations for Picard's case. 26
Pages, 3 figure
Building Confidential and Efficient Query Services in the Cloud with RASP Data Perturbation
With the wide deployment of public cloud computing infrastructures, using
clouds to host data query services has become an appealing solution for the
advantages on scalability and cost-saving. However, some data might be
sensitive that the data owner does not want to move to the cloud unless the
data confidentiality and query privacy are guaranteed. On the other hand, a
secured query service should still provide efficient query processing and
significantly reduce the in-house workload to fully realize the benefits of
cloud computing. We propose the RASP data perturbation method to provide secure
and efficient range query and kNN query services for protected data in the
cloud. The RASP data perturbation method combines order preserving encryption,
dimensionality expansion, random noise injection, and random projection, to
provide strong resilience to attacks on the perturbed data and queries. It also
preserves multidimensional ranges, which allows existing indexing techniques to
be applied to speedup range query processing. The kNN-R algorithm is designed
to work with the RASP range query algorithm to process the kNN queries. We have
carefully analyzed the attacks on data and queries under a precisely defined
threat model and realistic security assumptions. Extensive experiments have
been conducted to show the advantages of this approach on efficiency and
security.Comment: 18 pages, to appear in IEEE TKDE, accepted in December 201
Panphasia: a user guide
We make a very large realisation of a Gaussian white noise field, called
PANPHASIA, public by releasing software that computes this field. Panphasia is
designed specifically for setting up Gaussian initial conditions for
cosmological simulations and resimulations of structure formation. We make
available both software to compute the field itself and codes to illustrate
applications including a modified version of a public serial initial conditions
generator. We document the software and present the results of a few basic
tests of the field. The properties and method of construction of Panphasia are
described in full in a companion paper Jenkins 2013.Comment: 11 pages, 2 figures. Software to calculate Panphasia is available
from: http://icc.dur.ac.uk/Panphasia.ph
Relation Between Gravitational Mass and Baryonic Mass for Non-Rotating and Rapidly Rotating Neutron Stars
With a selected sample of neutron star (NS) equations of state (EOSs) that are consistent with the current observations and have a range of maximum masses, we investigate the relations between NS gravitational mass Mg and baryonic mass Mb, and the relations between the maximum NS mass supported through uniform rotation (Mmax) and that of nonrotating NSs (MTOV). We find that for an EOS-independent quadratic, universal transformation formula (Mb=Mg+A×M2g)(Mb=Mg+A×Mg2), the best-fit A value is 0.080 for non-rotating NSs, 0.064 for maximally rotating NSs, and 0.073 when NSs with arbitrary rotation are considered. The residual error of the transformation is ∼ 0.1M⊙ for non-spin or maximum-spin, but is as large as ∼ 0.2M⊙ for all spins. For different EOSs, we find that the parameter A for non-rotating NSs is proportional to R−11.4R1.4−1 (where R1.4 is NS radius for 1.4M⊙ in units of km). For a particular EOS, if one adopts the best-fit parameters for different spin periods, the residual error of the transformation is smaller, which is of the order of 0.01M⊙ for the quadratic form and less than 0.01M⊙ for the cubic form ((Mb=Mg+A1×M2g+A2×M3g)(Mb=Mg+A1×Mg2+A2×Mg3)). We also find a very tight and general correlation between the normalized mass gain due to spin Δm = (Mmax − MTOV)/MTOV and the spin period normalized to the Keplerian period PP, i.e., log10Δm=(−2.74±0.05)log10P+log10(0.20±0.01)log10Δm=(−2.74±0.05)log10P+log10(0.20±0.01), which is independent of EOS models. These empirical relations are helpful to study NS-NS mergers with a long-lived NS merger product using multi-messenger data. The application of our results to GW170817 is discussed
Gaussian Quantum Information
The science of quantum information has arisen over the last two decades
centered on the manipulation of individual quanta of information, known as
quantum bits or qubits. Quantum computers, quantum cryptography and quantum
teleportation are among the most celebrated ideas that have emerged from this
new field. It was realized later on that using continuous-variable quantum
information carriers, instead of qubits, constitutes an extremely powerful
alternative approach to quantum information processing. This review focuses on
continuous-variable quantum information processes that rely on any combination
of Gaussian states, Gaussian operations, and Gaussian measurements.
Interestingly, such a restriction to the Gaussian realm comes with various
benefits, since on the theoretical side, simple analytical tools are available
and, on the experimental side, optical components effecting Gaussian processes
are readily available in the laboratory. Yet, Gaussian quantum information
processing opens the way to a wide variety of tasks and applications, including
quantum communication, quantum cryptography, quantum computation, quantum
teleportation, and quantum state and channel discrimination. This review
reports on the state of the art in this field, ranging from the basic
theoretical tools and landmark experimental realizations to the most recent
successful developments.Comment: 51 pages, 7 figures, submitted to Reviews of Modern Physic
- …