a modified model has been analytically developed to describe the induction time of an elliptic air bubble in contact with an elliptic hydrophobic oil droplet. the role of hydrophobicity was revealed in the slippage of liquid over the surfaces of bubble and droplet. in this condition, the analytical relationships for pressure distribution and consequently hydrodynamic resistance force through th...

advanced metering infrastructure (ami) is a key part of the smart grid; thus, one of the most important concerns is to offer a secure mutual authentication.  this study focuses on communication between a smart meter and a server on the utility side. hence, a mutual authentication mechanism in ami is presented based on the elliptic curve cryptography (ecc) and one time signature (ots) consists o...

Elliptic curves in Hesse form admit more suitable arithmetic than ones in Weierstrass form. But elliptic curve cryptosystems usually use Weierstrass form. It is known that both those forms are birationally equivalent. Birational equivalence is relatively hard to compute. We prove that elliptic curves in Hesse form and in Weierstrass form are linearly equivalent over initial field or its small e...

The produced electric and magnetic fields due to lightning strikes to mountainous ground are determined in this paper. For the sake of simplicity a cone-shaped ground with finite conductivity is assumed to represent a natural nonflat ground. By this assumption, we deal with an axillary symmetrical structure so we use the cylindrical 2D-FDTD to save the simulation memory and time, dramatically. ...

In this paper, we introduce a cone generalized semi-cyclicφ−contraction maps and prove best proximity points theorems for such mapsin cone metric spaces. Also, we study existence and convergence results ofbest proximity points of such maps in normal cone metric spaces. Our resultsgeneralize some results on the topic.

Pairing-based cryptosystems rely on bilinear non-degenerate maps called pairings, such as the Tate and Weil pairings defined over certain elliptic curve groups. In this paper we show how to compress pairing values, how to couple this technique with that of point compression, and how to benefit from the compressed representation to speed up exponentiations involving pairing values, as required i...

Elliptic curve cryptosystems are usually implemented over fields of characteristic two or over (large) prime fields. For large prime fields, projective coordinates are more suitable as they reduce the computational workload in a point multiplication. In this case, choosing for parameter a the value −3 further reduces the workload. Over Fp, not all elliptic curves can be rescaled through isomorp...

The isogeny for elliptic curve cryptosystems was initially used for the efficient improvement of order counting methods. Recently, Smart proposed the countermeasure using isogeny for resisting the refined differential power analysis by Goubin (Goubin’s attack). In this paper, we examine the countermeasure using isogeny against zero-value point (ZVP) attack that is generalization of Goubin’s att...