In this paper we characterize pairs of Rosenberg relations (ρ, σ) with the property that the endomorphism monoid of one of the relations is properly contained in the endomorphism monoid of the other relation. We focus on the situations where one of the relations is a partial order, or a central relation. AMS Mathematics Subject Classification (2000): 08A35, 06A06

• A submitted manuscript is the author's version of the article upon submission and before peer-review. There can be important differences between the submitted version and the official published version of record. People interested in the research are advised to contact the author for the final version of the publication, or visit the DOI to the publisher's website. • The final author version ...

According to a result by K. B. Lee, the lattice of varieties of pseudocomplemented distributive lattices is the ui + 1 chain B_i C Bo C Bi C • ■ ■ C Bn C •■ • C Bw in which the first three varieties are formed by trivial, Boolean, and Stone algebras respectively. In the present paper it is shown that any Stone algebra is determined within Bi by its endomorphism monoid, and that there are at mos...

We consider endomorphism monoids of graphs. It is well-known that any monoid can be represented as the endomorphism monoid M of some graph Γ with countably many colors. We give a new proof of this theorem such that the isomorphism between the endomorphism monoid End(Γ) and M is absolute, i.e. End(Γ) ∼= M holds in any generic extension of the given universe of set theory. This is true if and onl...

In EUROCRYPT 2009, Galbraith, Lin and Scott constructed an efficiently computable endomorphism for a large family of elliptic curves defined over finite fields of large characteristic. They demonstrated that the endomorphism can be used to accelerate scalar multiplication in the elliptic curve cryptosystem based on these curves. In this paper we extend the method to any genus 2 hyperelliptic cu...

The notions of density, thinness, residue and ideal in a free monoid can all be expressed in terms of the infix order. Guided by these definitions we introduce the same notions with respect to arbitrary binary relations. We then investigate properties of these generalized notions and explore the connection to the theory of codes. We show that, under certain assumptions about the relation, densi...

We consider the endomorphism ring computation problem for supersingular elliptic curves, constructive versions of Deuring’s correspondence, and the security of Charles-Goren-Lauter’s cryptographic hash function. We show that constructing Deuring’s correspondence is easy in one direction and equivalent to the endomorphism ring computation problem in the other direction. We also provide a collisi...