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.

The category k-BFAlg of all k-algebras with a bilinear form, whose objects are pairs (R,b) where R is k-algebra and b:R×R→k mapping, equivalent to the unital A for which canonical homomorphism (k,1)→(A,1A) splitting monomorphism in k-Mod. Call left inverses this “weak augmentations” algebra. There isomorphism between weak augmentation (A,bA) form bA compatible multiplication A, i.e., such that ...

We propose Compatibility Weighted Voting Games, a variant of Weighted Voting Games in which some pairs of agents are compatible and some are not. In a Weighted Voting Game each agent has a weight, and a set of agents can form a winning coalition if the sum of their weights is at least a given quota. Whereas the original Weighted Voting Game model assumes that all agents are compatible, we consi...

The empirical joint distribution of return-pairs on stock indices displays high tail-dependence in the lower tail and low tail-dependence in the upper tail. The presence of tail-dependence is not compatible with the assumption of (conditional) joint normality. The presence of asymmetric-tail dependence is not compatible with the assumption of a joint student -t distribution. A general test for ...

Compatible Hamiltonian pairs play a crucial role in the structure theory of integrable systems. In this paper we consider the question of how much of the structure given by compatibility is bound to the situation of hamiltonian dynamic systems and how much of that can be transferred to a complete abstract situation where the algebraic structures under consideration are given by bilinear maps on...

We study a two-sided matching model with a finite number of agents and with transferable utility: agents on both sides of the market are privately informed about multi-dimensional attributes that determine the match value of each pair. Utility functions are assumed to be quasi-linear, and monetary transfers among agents are feasible. We ask the following question: what divisions of surplus amon...

Improving testability during the early stages of HighLevel Synthesis (HLS) reduces test hardware overheads, test costs, design iterations, and also improves fault coverage [1]. In this paper, we present a novel register allocation algorithm which is based on weighted graph coloring, targeting testability improvement. 1. Proposed testability model In our register allocation method, we construct ...

Transcription activator-like effectors (TALEs) are extremely effective, single-molecule DNA-targeting molecular cursors used for locus-specific genome science applications, including high-precision molecular medicine and other genome engineering applications. TALEs are used in genome engineering for locus-specific DNA editing and imaging, as artificial transcriptional activators and repressors,...