128 research outputs found
Failure regime in (1+1) dimensions in fibrous materials
In this paper, we introduce a model for fracture in fibrous materials that
takes into account the rupture height of the fibers, in contrast with previous
models. Thus, we obtain the profile of the fracture and calculate its
roughness, defined as the variance around the mean height. We investigate the
relationship between the fracture roughness and the fracture toughness.Comment: 4 pages, 4 figures.eps, Revte
Solution and Asymptotic Behavior for a Nonlocal Coupled System of Reaction-Diffusion
This paper concerns with existence, uniqueness and asymptotic behavior of the
solutions for a nonlocal coupled system of reaction-diffusion. We prove the
existence and uniqueness of weak solutions by the Faedo-Galerkin method and
exponential decay of solutions by the classic energy method. We improve the
results obtained by Chipot-Lovato and Menezes for coupled systems. A numerical
scheme is presented
Efficient Doubling on Genus Two Curves over Binary Fields
In most algorithms involving elliptic and hyperelliptic curves, the costliest part consists in computing multiples of ideal classes. This paper investigates how to compute faster doubling over fields of characteristic two.
We derive explicit doubling formulae making strong use of the defining equation of the curve. We analyze how many field operations are needed depending on the curve making clear how much generality one loses by the respective choices. Note, that none of the proposed types is known to
be weak â one only could be suspicious because of the more special types. Our results allow to choose curves from a large enough variety which have extremely fast doubling needing only half the time of an addition. Combined with a sliding window method this leads to fast computation
of scalar multiples. We also speed up the general case
The elliptic curve discrete logarithm problem and equivalent hard problems for elliptic divisibility sequences
We define three hard problems in the theory of elliptic divisibility
sequences (EDS Association, EDS Residue and EDS Discrete Log), each of which is
solvable in sub-exponential time if and only if the elliptic curve discrete
logarithm problem is solvable in sub-exponential time. We also relate the
problem of EDS Association to the Tate pairing and the MOV, Frey-R\"{u}ck and
Shipsey EDS attacks on the elliptic curve discrete logarithm problem in the
cases where these apply.Comment: 18 pages; revised version includes some small mathematical
corrections, reformatte
On the Static Diffie-Hellman Problem on Elliptic Curves over Extension Fields
We show that for any elliptic curve E(Fqn ), if an adversary has access to a Static Diffie-Hellman Problem (Static DHP) oracle, then by making O(q1â 1/n+1) Static DHP oracle queries during an initial learning phase, for fixed n > 1 and q â â the adversary can solve any further instance of the Static DHP in heuristic time OË(q1â 1/n+1). Our proposal also solves the Delayed Target DHP as defined by Freeman, and naturally extends to provide algorithms for solving the Delayed Target DLP, the One-More DHP and One-More DLP, as studied by Koblitz and Menezes in the context of Jacobians of hyperelliptic curves of small genus. We also argue that for any group in which index calculus can be effectively applied, the above problems have a natural relationship, and will always be easier than the DLP. While practical only for very small n, our algorithm reduces the security provided by the elliptic curves defined over Fp2 and Fp4 proposed by Galbraith, Lin and Scott at EUROCRYPT 2009, should they be used in any protocol where a user can be made to act as a proxy Static DHP oracle, or if used in protocols whose security is related to any of the above problems
A Privacy-Friendly Loyalty System Based on Discrete Logarithms over Elliptic Curves
Abstract. Systems for the support of customer relationship management are be-coming increasingly attractive for vendors. Loyalty systems provide an interest-ing possibility for vendors in customer relationship management. This holds for both real world and online vendors. However, beside some potential benefits of a loyalty system, customers may also fear an invasion into their privacy, and may thus refuse to participate in such programs. In this paper, we present a privacy-friendly loyalty system to be used by online vendors to issue loyalty points. The system prevents vendors from exploiting data for the creation of customer profiles by providing unconditional unlinkability of loyalty points with regard to purchases. In the proposed system, we apply the difficulty for the computa-tion of discrete logarithms in a group of prime order to construct a secure and privacy-friendly counter. More precisely, all computations are carried out over special cryptographic groups based on elliptic curves where the decisional Diffie-Hellman problems can be solved easily while the computational Diffie-Hellman is believed to be hard.
Breaking â128-bit Secureâ Supersingular Binary Curves
In late 2012 and early 2013 the discrete logarithm problem (DLP) in finite fields of small characteristic underwent a dramatic series of breakthroughs, culminating in a heuristic quasi-polynomial time algorithm, due to Barbulescu, Gaudry, Joux and ThomĂ©. Using these developments, Adj, Menezes, Oliveira and RodrĂguez-HenrĂquez analysed the concrete security of the DLP, as it arises from pairings on (the Jacobians of) various genus one and two supersingular curves in the literature, which were originally thought to be 128-bit secure. In particular, they suggested that the new algorithms have no impact on the security of a genus one curve over F21223 , and reduce the security of a genus two curve over F2367 to 94.6 bits. In this paper we propose a new field representation and efficient general descent principles which together make the new techniques far more practical. Indeed, at the â128-bit security levelâ our analysis shows that the aforementioned genus one curve has approximately 59 bits of security, and we report a total break of the genus two curv
A New Family of Pairing-Friendly elliptic curves
International audienceThere have been recent advances in solving the finite extension field discrete logarithm problem as it arises in the context of pairing-friendly elliptic curves. This has lead to the abandonment of approaches based on supersingular curves of small characteristic, and to the reconsideration of the field sizes required for implementation based on non-supersingular curves of large characteristic. This has resulted in a revision of recommendations for suitable curves, particularly at a higher level of security. Indeed for a security level of 256 bits, the BLS48 curves have been suggested, and demonstrated to be superior to other candidates. These curves have an embedding degree of 48. The well known taxonomy of Freeman, Scott and Teske only considered curves with embedding degrees up to 50. Given some uncertainty around the constants that apply to the best discrete logarithm algorithm, it would seem to be prudent to push a little beyond 50. In this note we announce the discovery of a new family of pairing friendly elliptic curves which includes a new construction for a curve with an embedding degree of 54
- âŠ