582 research outputs found
Hard isogeny problems over RSA moduli and groups with infeasible inversion
We initiate the study of computational problems on elliptic curve isogeny
graphs defined over RSA moduli. We conjecture that several variants of the
neighbor-search problem over these graphs are hard, and provide a comprehensive
list of cryptanalytic attempts on these problems. Moreover, based on the
hardness of these problems, we provide a construction of groups with infeasible
inversion, where the underlying groups are the ideal class groups of imaginary
quadratic orders.
Recall that in a group with infeasible inversion, computing the inverse of a
group element is required to be hard, while performing the group operation is
easy. Motivated by the potential cryptographic application of building a
directed transitive signature scheme, the search for a group with infeasible
inversion was initiated in the theses of Hohenberger and Molnar (2003). Later
it was also shown to provide a broadcast encryption scheme by Irrer et al.
(2004). However, to date the only case of a group with infeasible inversion is
implied by the much stronger primitive of self-bilinear map constructed by
Yamakawa et al. (2014) based on the hardness of factoring and
indistinguishability obfuscation (iO). Our construction gives a candidate
without using iO.Comment: Significant revision of the article previously titled "A Candidate
Group with Infeasible Inversion" (arXiv:1810.00022v1). Cleared up the
constructions by giving toy examples, added "The Parallelogram Attack" (Sec
5.3.2). 54 pages, 8 figure
Implementation and evaluation of improved Gaussian sampling for lattice trapdoors
We report on our implementation of a new Gaussian sampling algorithm for lattice trapdoors. Lattice trapdoors are used in a wide array of lattice-based cryptographic schemes including digital signatures, attributed-based encryption, program obfuscation and others. Our implementation provides Gaussian sampling for trapdoor lattices with prime moduli, and supports both single- and multi-threaded execution. We experimentally evaluate our implementation through its use in the GPV hash-and-sign digital signature scheme as a benchmark. We compare our design and implementation with prior work reported in the literature. The evaluation shows that our implementation 1) has smaller space requirements and faster runtime, 2) does not require multi-precision floating-point arithmetic, and 3) can be used for a broader range of cryptographic primitives than previous implementations
Homomorphic public-key cryptosystems and encrypting boolean circuits
In this paper homomorphic cryptosystems are designed for the first time over
any finite group. Applying Barrington's construction we produce for any boolean
circuit of the logarithmic depth its encrypted simulation of a polynomial size
over an appropriate finitely generated group
Constructing Permutation Rational Functions From Isogenies
A permutation rational function is a rational function
that induces a bijection on , that is, for all
there exists exactly one such that . Permutation
rational functions are intimately related to exceptional rational functions,
and more generally exceptional covers of the projective line, of which they
form the first important example.
In this paper, we show how to efficiently generate many permutation rational
functions over large finite fields using isogenies of elliptic curves, and
discuss some cryptographic applications. Our algorithm is based on Fried's
modular interpretation of certain dihedral exceptional covers of the projective
line (Cont. Math., 1994)
On differential uniformity of maps that may hide an algebraic trapdoor
We investigate some differential properties for permutations in the affine
group, of a vector space V over the binary field, with respect to a new group
operation , inducing an alternative vector space structure on .Comment: arXiv admin note: text overlap with arXiv:1411.768
Public Key Cryptography based on Semigroup Actions
A generalization of the original Diffie-Hellman key exchange in
found a new depth when Miller and Koblitz suggested that such a protocol could
be used with the group over an elliptic curve. In this paper, we propose a
further vast generalization where abelian semigroups act on finite sets. We
define a Diffie-Hellman key exchange in this setting and we illustrate how to
build interesting semigroup actions using finite (simple) semirings. The
practicality of the proposed extensions rely on the orbit sizes of the
semigroup actions and at this point it is an open question how to compute the
sizes of these orbits in general and also if there exists a square root attack
in general. In Section 2 a concrete practical semigroup action built from
simple semirings is presented. It will require further research to analyse this
system.Comment: 20 pages. To appear in Advances in Mathematics of Communication
- …