We present instances of MPKCs (multivariate public key cryptosystems) with design, given the best attacks we know, and implement them on commodity PC hardware. We also show that they can hold their own compared to traditional alternatives. In fact, they can be up to an order of magnitude faster.

We present instances of MPKCs (multivariate public key cryptosystems) with design, given the best attacks we know, and implement them on commodity PC hardware. We also show that they can hold their own compared to traditional alternatives. In fact, they can be up to an order of magnitude faster.

For small involutive and integral quantaloids Q it is shown that covariant presheaves on symmetric Q-categories are equivalent to certain subalgebras of a speci c monad on the category of symmetric Q-categories. This construction is related to a weakening of the subobject classi er axiom which does not require the classi cation of all subalgebras, but only guarantees that classi able subalgebra...

The recently proposed Nieh-Yan modified teleparallel gravity is a parity-violating model that modifies the general relativity equivalent by term. This healthy and simple in form. In this paper, we consider application of to Solar System investigate its slow-motion weak-field approximation terms parametrized post-Newtonian formalism. We find all parameters are same as those relativity, which mak...

PrCa, P., Graphs and topologies on discrete sets, Discrete Mathematics 103 (1992) 189-197. We show that a graph admits a topology on its node set which is compatible with the usual connectivity of undirected graphs if, and only if, it is a comparability graph. Then, we give a similar condition for the weak connectivity of oriented graphs and show there is no topology which is compatible with th...

We examine incentive-compatible mechanisms for fair financing and efficient selection of a public budget (or public good). A mechanism selects the level of the public budget and imposes taxes on individuals. Individuals’ preferences are quasilinear. Fairness is expressed as weak monotonicity (called scale monotonicity) of the tax imposed on an individual as a function of his benefit from an inc...

Two plane geometric graphs are said to be compatible when their union is a plane geometric graph. Let S be a set of n points in the Euclidean plane in general position and let T be any given plane geometric tree whose vertex set is S. The main problem we consider in this work consists of finding a second plane geometric tree T ′ on S, such that T ′ is compatible with T and shares with T a minim...