Sciweavers

DCC
2008
IEEE
14 years 11 months ago
An improved list decoding algorithm for the second order Reed-Muller codes and its applications
We propose an algorithm which is an improved version of the Kabatiansky-Tavernier list decoding algorithm for the second order binary Reed-Muller code RM(2, m), of length n = 2m , ...
Rafaël Fourquet, Cédric Tavernier
DCC
2008
IEEE
14 years 11 months ago
Extractors for binary elliptic curves
We propose a simple and efficient deterministic extractor for an ordinary elliptic curve E, defined over F2n , where n = 2 and is a positive integer. Our extractor, for a given poi...
Reza Rezaeian Farashahi, Ruud Pellikaan, Andrey Si...
DCC
2008
IEEE
14 years 11 months ago
Idempotents in the neighbourhood of Patterson-Wiedemann functions having Walsh spectra zeros
In this paper we study the neighbourhood of 15-variable Patterson-Wiedemann (PW) functions, i.e., the functions that differ by a small Hamming distance from the PW functions in te...
Sumanta Sarkar, Subhamoy Maitra
DCC
2008
IEEE
14 years 11 months ago
Semantic security for the McEliece cryptosystem without random oracles
In this paper, we formally prove that padding the plaintext with a random bit-string provides the semantic security against chosen plaintext attack (IND-CPA) for the McEliece (and ...
Ryo Nojima, Hideki Imai, Kazukuni Kobara, Kirill M...
DCC
2008
IEEE
14 years 11 months ago
Edge local complementation and equivalence of binary linear codes
Abstract. Orbits of graphs under the operation edge local complementation (ELC) are defined. We show that the ELC orbit of a bipartite graph corresponds to the equivalence class of...
Lars Eirik Danielsen, Matthew G. Parker
DCC
2008
IEEE
14 years 11 months ago
On solving sparse algebraic equations over finite fields
A system of algebraic equations over a finite field is called sparse if each equation depends on a small number of variables. Finding efficiently solutions to the system is an unde...
Igor Semaev
DCC
2008
IEEE
14 years 11 months ago
The trace of an optimal normal element and low complexity normal bases
Let Fq be a finite field and consider an extension Fqn where an optimal normal element exists. Using the trace of an optimal normal element in Fqn , we provide low complexity norma...
Maria Christopoulou, Theodoulos Garefalakis, Danie...
DCC
2008
IEEE
14 years 11 months ago
On the second weight of generalized Reed-Muller codes
: Not much is known about the weight distribution of the generalized Reed-Muller code RMq(s, m) when q > 2, s > 2 and m 2 . Even the second weight is only known for values o...
Olav Geil
DCC
2008
IEEE
14 years 11 months ago
Distorting symmetric designs
A simple replacement approach is used to construct new symmetric and affine designs from projective or affine spaces. This is used to construct symmetric designs with a given autom...
Ulrich Dempwolff, William M. Kantor
DCC
2008
IEEE
14 years 11 months ago
A synthetic indifferentiability analysis of some block-cipher-based hash functions
At ASIACRYPT 2006, Chang et al. analyzed the indifferentiability of some popular hash functions based on block ciphers, namely, the twenty collision resistant PGV, the MDC2 and th...
Zheng Gong, Xuejia Lai, Kefei Chen