Advanced search
Start date
Betweenand

Construction, decoding and implementation of F_q linear codes. Performanca of SPC product codes and cryptanalysis of the shrinking generators.

Grant number: 15/07246-0
Support Opportunities:Scholarships in Brazil - Post-Doctoral
Effective date (Start): August 01, 2015
Effective date (End): December 31, 2017
Field of knowledge:Engineering - Electrical Engineering - Telecommunications
Principal Investigator:Marcelo Firer
Grantee:Sara Díaz Cardell
Host Institution: Instituto de Matemática, Estatística e Computação Científica (IMECC). Universidade Estadual de Campinas (UNICAMP). Campinas , SP, Brazil
Associated research grant:13/25977-7 - Security and reliability of Information: theory and practice, AP.TEM

Abstract

First, we work on a construction of MDS Fq-linear codes over Fqb based on the isomorphism between _fields Fq[C] and Fqb , where C is the companion matrix of a primitive polynomial of degree b in Fq[x]. If the parameters of one of our codes are [n; k; d], we can recover up to n-k erasures. We propose an algorithm to recover the lost information symbols just solving a linear system with tb unknowns, where t in the number of erased information symbols. We would like to deeply study this algorithm to make it e_cient and compare these codes with other MDS codes. We would also like to find good cryptographic applications of these codes, such as the construction of optimal linear di_usion layers in block ciphers.At the same time, we study the performance of the SPC (single parity-check) simple product codes. These codes have a small minimum distance and, thus, their error correction capability is very limited. However, they are able to recover a higher number of erasures in special cases. We would like to count and analyse these cases in order to study the performance of these codes. Furthermore, SPC product codes obtained with more than two SPC codes have never been studied. Solving this problem can help us to solve graph theory problems, since an erasure pattern representing a codeword of an SPC product code can be also seen as a bipartite graph, where the erasures are the edges.Regarding cryptography, we model some cryptographic non-linear sequence generators, called shrinking generators, using linear cellular automata (CA). The sequences produced by these generators can be obtained as one of the output sequences generated by a family of regular CA. We can take advantage of this linearity and propose an e_cient cryptanalysis of these generators. We would also like study the cryptographic properties of the other sequences generated by the CA and try to model model other generators using CA. Besides, we want to connect CA with Neural Networks (NN) and then study our cryptographic problem from a new perspective never considered before.

News published in Agência FAPESP Newsletter about the scholarship:
Articles published in other media outlets (0 total):
More itemsLess items
VEICULO: TITULO (DATA)
VEICULO: TITULO (DATA)

Scientific publications (15)
(References retrieved automatically from Web of Science and SciELO through information on FAPESP grants and their corresponding numbers as mentioned in the publications by the authors)
CARDELL, SARA D.; FUSTER-SABATER, AMPARO. Linear Models for the Self-Shrinking Generator Based on CA. JOURNAL OF CELLULAR AUTOMATA, v. 11, n. 2-3, p. 195-211, . (15/07246-0)
CARDELL, SARA D.; CLIMENT, JOAN-JOSEP. AN APPROACH TO THE PERFORMANCE OF SPC PRODUCT CODES ON THE ERASURE CHANNEL. Advances in Mathematics of Communications, v. 10, n. 1, SI, p. 11-28, . (15/07246-0)
CARDELL, SARA D.; FUSTER-SABATER, AMPARO. Discrete linear models for the generalized self-shrunken sequences. FINITE FIELDS AND THEIR APPLICATIONS, v. 47, p. 222-241, . (15/07246-0)
CARDELL, SARA D.; FUSTER-SABATER, AMPARO. MODELLING THE SHRINKING GENERATOR IN TERMS OF LINEAR CA. Advances in Mathematics of Communications, v. 10, n. 4, p. 797-809, . (15/07246-0)
CARDELL, SARA D.; CLIMENT, JOAN-JOSEP. A construction of primitive polynomials over finite fields. LINEAR & MULTILINEAR ALGEBRA, v. 65, n. 12, p. 2424-2431, . (15/07246-0)
CARDELL, SARA D.; NAPP, DIEGO; FIRER, MARCELO; IEEE. Unrestricted Generalized Column Distances: A Wider Definition. 2019 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), v. N/A, p. 5-pg., . (15/07246-0, 13/25977-7)
CARDELL, SARA D.; FUSTER-SABATER, AMPARO; ALTINTAS, I; NORMAN, M; DONGARRA, J; KRZHIZHANOVSKAYA, VV; LEES, M; SLOOT, PMA. Recovering the MSS-sequence via CA. PROCEEDINGS OF THE XI LATIN AND AMERICAN ALGORITHMS, GRAPHS AND OPTIMIZATION SYMPOSIUM, v. 80, p. 8-pg., . (15/07246-0)
FUSTER-SABATER, AMPARO; CARDELL, SARA D.; GERVASI, O; MURGANTE, B; MISRA, S; STANKOVA, E; TORRE, CM; ROCHA, AMAC; TANIAR, D; APDUHAN, BO; et al. Computing the Linear Complexity in a Class of Cryptographic Sequences. COMPUTATIONAL SCIENCE AND ITS APPLICATIONS - ICCSA 2018, PT I, v. 10960, p. 13-pg., . (15/07246-0)
CARDELL, SARA D.; CLIMENT, JOAN-JOSEP; ROCA, ALICIA; BARBERO, AI; SKACHEK, V; YTREHUS, O. Decoding a Perturbed Sequence Generated by an LFSR. CODING THEORY AND APPLICATIONS, ICMCTA 2017, v. 10495, p. 10-pg., . (15/07246-0)
CARDELL, SARA D.; FUSTER-SABATER, AMPARO; GERVASI, O; MURGANTE, B; MISRA, S; BORRUSO, G; TORRE, CM; ROCHA, AMAC; TANIAR, D; APDUHAN, BO; et al. Linear Models for High-Complexity Sequences. COMPUTATIONAL SCIENCE AND ITS APPLICATIONS - ICCSA 2017, PT I, v. 10404, p. 11-pg., . (15/07246-0)
CARDELL, SARA D.; ARANHA, DIEGO F.; FUSTER-SABATER, AMPARO. Recovering Decimation-Based Cryptographic Sequences by Means of Linear CAs. LOGIC JOURNAL OF THE IGPL, v. 28, n. 4, p. 430-448, . (16/50476-0, 15/07246-0)
CARDELL, SARA D.; FIRER, MARCELO; NAPP, DIEGO. Generalized Column Distances. IEEE TRANSACTIONS ON INFORMATION THEORY, v. 66, n. 11, p. 6863-6871, . (15/07246-0, 13/25977-7)
CARDELL, SARA D.; FUSTER-SABATER, AMPARO; SHI, Y; FU, H; TIAN, Y; KRZHIZHANOVSKAYA, VV; LEES, MH; DONGARRA, J; SLOOT, PMA. The t-Modified Self-Shrinking Generator. COMPUTATIONAL SCIENCE - ICCS 2018, PT I, v. 10860, p. 11-pg., . (15/07246-0)
CARDELL, SARA D.; CLIMENT, JOAN-JOSEP. AN APPROACH TO THE PERFORMANCE OF SPC PRODUCT CODES ON THE ERASURE CHANNEL. Advances in Mathematics of Communications, v. 10, n. 1, p. 18-pg., . (15/07246-0)
CARDELL, SARA D.; FIRER, MARCELO; NAPP, DIEGO; IEEE. Generalized column distances for convolutional codes. 2017 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), v. N/A, p. 5-pg., . (15/07246-0, 13/25977-7)

Please report errors in scientific publications list using this form.