702 research outputs found
Mutually Unbiased Bases, Generalized Spin Matrices and Separability
A collection of orthonormal bases for a complex dXd Hilbert space is called
mutually unbiased (MUB) if for any two vectors v and w from different bases the
square of the inner product equals 1/d: || ^{2}=1/d. The MUB problem is to
prove or disprove the the existence of a maximal set of d+1 bases. It has been
shown in [W. K. Wootters, B. D. Fields, Annals of Physics, 191, no. 2, 363-381,
(1989)] that such a collection exists if d is a power of a prime number p. We
revisit this problem and use dX d generalizations of the Pauli spin matrices to
give a constructive proof of this result. Specifically we give explicit
representations of commuting families of unitary matrices whose eigenvectors
solve the MUB problem. Additionally we give formulas from which the orthogonal
bases can be readily computed. We show how the techniques developed here
provide a natural way to analyze the separability of the bases. The techniques
used require properties of algebraic field extensions, and the relevant part of
that theory is included in an Appendix
On the Exact Evaluation of Certain Instances of the Potts Partition Function by Quantum Computers
We present an efficient quantum algorithm for the exact evaluation of either
the fully ferromagnetic or anti-ferromagnetic q-state Potts partition function
Z for a family of graphs related to irreducible cyclic codes. This problem is
related to the evaluation of the Jones and Tutte polynomials. We consider the
connection between the weight enumerator polynomial from coding theory and Z
and exploit the fact that there exists a quantum algorithm for efficiently
estimating Gauss sums in order to obtain the weight enumerator for a certain
class of linear codes. In this way we demonstrate that for a certain class of
sparse graphs, which we call Irreducible Cyclic Cocycle Code (ICCC_\epsilon)
graphs, quantum computers provide a polynomial speed up in the difference
between the number of edges and vertices of the graph, and an exponential speed
up in q, over the best classical algorithms known to date
Theory of Finite Pseudoalgebras
Conformal algebras, recently introduced by Kac, encode an axiomatic
description of the singular part of the operator product expansion in conformal
field theory. The objective of this paper is to develop the theory of
``multi-dimensional'' analogues of conformal algebras. They are defined as Lie
algebras in a certain ``pseudotensor'' category instead of the category of
vector spaces. A pseudotensor category (as introduced by Lambek, and by
Beilinson and Drinfeld) is a category equipped with ``polylinear maps'' and a
way to compose them. This allows for the definition of Lie algebras,
representations, cohomology, etc. An instance of such a category can be
constructed starting from any cocommutative (or more generally,
quasitriangular) Hopf algebra . The Lie algebras in this category are called
Lie -pseudoalgebras.
The main result of this paper is the classification of all simple and all
semisimple Lie -pseudoalgebras which are finitely generated as -modules.
We also start developing the representation theory of Lie pseudoalgebras; in
particular, we prove analogues of the Lie, Engel, and Cartan-Jacobson Theorems.
We show that the cohomology theory of Lie pseudoalgebras describes extensions
and deformations and is closely related to Gelfand-Fuchs cohomology. Lie
pseudoalgebras are closely related to solutions of the classical Yang-Baxter
equation, to differential Lie algebras (introduced by Ritt), and to Hamiltonian
formalism in the theory of nonlinear evolution equations. As an application of
our results, we derive a classification of simple and semisimple linear Poisson
brackets in any finite number of indeterminates.Comment: 102 pages, 7 figures, AMS late
Finite Fields: Theory and Applications
Finite fields are the focal point of many interesting geometric, algorithmic and combinatorial problems. The workshop was devoted to progress on these questions, with an eye also on the important applications of finite field techniques in cryptography, error correcting codes, and random number generation
Efficient Algorithms for Elliptic Curve Cryptosystems
Elliptic curves are the basis for a relative new class of public-key schemes. It is predicted that elliptic curves will replace many existing schemes in the near future. It is thus of great interest to develop algorithms which allow efficient implementations of elliptic curve crypto systems. This thesis deals with such algorithms. Efficient algorithms for elliptic curves can be classified into low-level algorithms, which deal with arithmetic in the underlying finite field and high-level algorithms, which operate with the group operation. This thesis describes three new algorithms for efficient implementations of elliptic curve cryptosystems. The first algorithm describes the application of the Karatsuba-Ofman Algorithm to multiplication in composite fields GF((2n)m). The second algorithm deals with efficient inversion in composite Galois fields of the form GF((2n)m). The third algorithm is an entirely new approach which accelerates the multiplication of points which is the core operation in elliptic curve public-key systems. The algorithm explores computational advantages by computing repeated point doublings directly through closed formulae rather than from individual point doublings. Finally we apply all three algorithms to an implementation of an elliptic curve system over GF((216)11). We provide ablolute performance measures for the field operations and for an entire point multiplication. We also show the improvements gained by the new point multiplication algorithm in conjunction with the k-ary and improved k-ary methods for exponentiation
Faster Correlation Attack on Bluetooth Keystream Generator E0
Abstract. We study both distinguishing and key-recovery attacks against E0, the keystream generator used in Bluetooth by means of correlation. First, a powerful computation method of correlations is formulated by a recursive expression, which makes it easier to calculate correlations of the finite state machine output sequences up to 26 bits for E0 and allows us to verify the two known correlations to be the largest for the first time. Second, we apply the concept of convolution to the analysis of the distinguisher based on all correlations, and propose an efficient distinguisher due to the linear dependency of the largest correlations. Last, we propose a novel maximum likelihood decoding algorithm based on fast Walsh transform to recover the closest codeword for any linear code of dimension L and length n. It requires time O(n + L · 2 L) and memory min(n, 2 L). This can speed up many attacks such as fast correlation attacks. We apply it to E0, and our best key-recovery attack works in 2 39 time given 2 39 consecutive bits after O(2 37) precomputation. This is the best known attack against E0 so far.
- …