In this paper, we extend the method of Scott and Barreto and present an explicit and simple algorithm to generate families of generalized MNT elliptic curves. Our algorithm allows us to obtain all families of generalized MNT curves with any given cofactor. Then, we analyze the complex multiplication equations of these families of curves and transform them into generalized Pell equation. As an e...

Generalized metric spaces are a common generalization of preorders and ordinary metric spaces (Lawvere, 1973). Combining Lawvere’s (1973) enriched-categorical and Smyth’s (1988, 1991) topological view on generalized metric spaces, it is shown how to construct (1) completion, (2) two topologies, and (3) powerdomains for generalized metric spaces. Restricted to the special cases of preorders and ...

In this paper, we extend the method of Scott and Barreto and present an explicit and simple algorithm to generate families of generalized MNT elliptic curves. Our algorithm allows us to obtain all families of generalized MNT curves with any given cofactor. Then, we analyze the complex multiplication equations of these families of curves and transform them into generalized Pell equation. As an e...

Geographic routing is a routing paradigm, which uses geographic coordinates of network nodes to determine routes. Greedy routing, the simplest form of geographic routing forwards a packet to the closest neighbor towards the destination. A greedy embedding is a embedding of a graph on a geometric space such that greedy routing always guarantees delivery. A Schnyder drawing is a classical way to ...

Abstract Every finite subunital of any generalized hermitian unital is itself a unital; the embedding given by an quadratic field extensions. In particular, with one (i.e., it originates from separable extension).

The vast majority of steganographic schemes for digital images stored in the raster format limit the amplitude of embedding changes to the smallest possible value. In this paper, we investigate the possibility to further improve the empirical security by allowing the embedding changes in highly textured areas to have a larger amplitude and thus embedding there a larger payload. Our approach is ...

The goal of data hiding techniques usually considers two issues, embedding capacity and image quality. Consequently, in order to achieve high embedding capacity and good image quality, a data hiding scheme combining run-length encoding (RLE) with multi-bit embedding is proposed in this paper. This work has three major contributions. First, the embedding capacity is increased 62% because the sec...