Sciweavers

IACR
2011
88views more  IACR 2011»
12 years 4 months ago
GCM, GHASH and Weak Keys
The Galois/Counter Mode (GCM) of operation has been standardized by NIST to provide single-pass authenticated encryption. The GHASH authentication component of GCM belongs to a cla...
Markku-Juhani O. Saarinen
ALT
2011
Springer
12 years 4 months ago
Semantic Communication for Simple Goals Is Equivalent to On-line Learning
Abstract. Previous works [11, 6] introduced a model of semantic communication between a “user” and a “server,” in which the user attempts to achieve a given goal for commun...
Brendan Juba, Santosh Vempala
MOC
2011
12 years 7 months ago
Calculating cyclotomic polynomials
Abstract. We present three algorithms to calculate Φn(z), the nth cyclotomic polynomial. The first algorithm calculates Φn(z) by a series of polynomial divisions, which we perfo...
Andrew Arnold, Michael B. Monagan
ECCC
2011
203views ECommerce» more  ECCC 2011»
12 years 7 months ago
Accelerated Slide- and LLL-Reduction
Abstract. Given an LLL-basis B of dimension n = hk we accelerate slide-reduction with blocksize k to run under a reasonable assumption within 1 6 n2 h log1+ε α local SVP-computat...
Claus-Peter Schnorr
ECCC
2011
206views ECommerce» more  ECCC 2011»
12 years 7 months ago
On the Degree of Univariate Polynomials Over the Integers
We study the following problem raised by von zur Gathen and Roche [GR97]: What is the minimal degree of a nonconstant polynomial f : {0, . . . , n} → {0, . . . , m}?
Gil Cohen, Amir Shpilka, Avishay Tal
ICASSP
2011
IEEE
12 years 8 months ago
Rank-deficient quadratic-form maximization over M-phase alphabet: Polynomial-complexity solvability and algorithmic developments
The maximization of a positive (semi)definite complex quadratic form over a finite alphabet is NP-hard and achieved through exhaustive search when the form has full rank. Howeve...
Anastasios T. Kyrillidis, George N. Karystinos
TWC
2010
12 years 11 months ago
Maximum-likelihood noncoherent OSTBC detection with polynomial complexity
Abstract--We prove that maximum-likelihood (ML) noncoherent sequence detection of orthogonal space-time block coded signals can always be performed in polynomial time with respect ...
Dimitris S. Papailiopoulos, George N. Karystinos
DCC
2010
IEEE
12 years 11 months ago
Parameter choices and a better bound on the list size in the Guruswami-Sudan algorithm for algebraic geometry codes
Abstract. Given an algebraic geometry code CL(D, P), the GuruswamiSudan algorithm produces a list of all codewords in CL(D, P) within a specified distance of a received word. The i...
Nathan Drake, Gretchen L. Matthews
CORR
2011
Springer
176views Education» more  CORR 2011»
12 years 11 months ago
Inner approximations for polynomial matrix inequalities and robust stability regions
Following a polynomial approach, many robust fixed-order controller design problems can be formulated as optimization problems whose set of feasible solutions is modelled by para...
Didier Henrion, Jean B. Lasserre
CAP
2010
12 years 11 months ago
Parallel sparse polynomial interpolation over finite fields
We present a probabilistic algorithm to interpolate a sparse multivariate polynomial over a finite field, represented with a black box. Our algorithm modifies the algorithm of Ben...
Seyed Mohammad Mahdi Javadi, Michael B. Monagan