Titlebook: Applied Algebra, Algebraic Algorithms and Error-Correcting Codes; 15th International S Marc Fossorier,Tom Høholdt,Alain Poli Conference pro

Picks-Disease

Mast-Cell

Energy Security and Development an application of our constructions, we provide a new pre-distributed primitive which yields non-interactive unconditionally secure zero knowledge proofs of any polynomial relation among commitments.

难解

A. A. Amrutha,P. Balachandra,M. Mathirajan written for linear code of length 2. of code ., where . for two different comprehensive codes .. As a result we obtain two different expressions for weight enumerator of code ...As example we consider a case ., where . . is the .-th order Reed-Muller code of lenght . = 2...

flamboyant

Shujie Yao,Maria Jesus Herreriases these two constructions, and asks whether each algebraic construction is equivalent to a combinatorial construction. We answer this question by giving an explicit counterexample in dimension 165 which has been constructed with the help of a computer algebra system.

开玩笑

obstruct

Fast Point Multiplication on Elliptic Curves through Isogenies,of the more general notion of isogenies to rescale the curve. As a side result, this also illustrates that selecting elliptic curves with . = −3 (as those recommended in most standards) is not restrictive.

妈妈不开心

Unconditionally Secure Homomorphic Pre-distributed Commitments, an application of our constructions, we provide a new pre-distributed primitive which yields non-interactive unconditionally secure zero knowledge proofs of any polynomial relation among commitments.

ADORE

Relative Duality in MacWilliams Identity, written for linear code of length 2. of code ., where . for two different comprehensive codes .. As a result we obtain two different expressions for weight enumerator of code ...As example we consider a case ., where . . is the .-th order Reed-Muller code of lenght . = 2...

arbiter

小隔间

Antonio Marquina,Mely Caballero-Anthonyace at least one of the pirates in such a collusion..In this paper we prove that socalled (2, 2)-separating codes often are collusion-secure against two pirates. In particular, we consider the best known explicit asymptotic construction of such codes, and prove that it is collusion-secure with better rate than any previously known schemes.