Welcome to Computer Algebra in Coding
Theory and Cryptography
CACTC

Special Session at the
19th International Conference on
Applications of Computer
Algebra 2013.
This is the 8th session (previous were held at ACA 2004, ACA 2005, ACA2008, ACA2012 with the same
senior organizer E. Martínez-Moro and in ACA 2006, ACA 2007, ACA 2010 were entitled "coding theory and cryptography" organized
by T. Shaska) devoted to providing a forum for exchange of ideas and research results related to Computer Algebra, both theoretical
and algorithmic
treatment of all kinds of symbolic objects, in application to Coding Theory and Cryptography.
Call For Papers and Participation
It is planned to have 20 1/2 hour contributed talks in the session. Submissions of 2-page extended abstracts should be
sent to the session organizers following the ACA 2013 deadline guidelines. Also in order
to aid in the creation of a proceedings for the meeting,
please use this LaTeX template for your abstract. (The document generated
by this template is located here.)
The submitted extended abstracts will be reviewed for soundness and relevance to the session.
Topics
Session topics include (but are not limited to) the following:- Computer Algebra in Coding Theory
Applications of the methods of applied algebraic geometry to coding theory including decoding algorithms, combinatorial constructions of codes, search of optimal codes ... - Computer Algebra in Cryptography
Algebraic cryptoanalysis. Post quantum, hash-based and lattice-based cryptography. Multivariate PKC... - Interactions between Coding, Crypto and C.A.
Secret sharing schemes. Steganography. Code-based cryptography...
Talks:
- 1.- J.J. Bernal (UM, Spain), D.H. Bueno (UM, Spain), J.J. Simon
(UM, Spain)
A characterization of cyclic codes whose minimum distance equals their maximum BCH bound. Abstract - 2.- N. Dück, K.H. Zimmermann (TU-Harburg, Germany)
Gröbner Bases and Linear Codes over Prime Fields Abstract - 3.- A. Fuster (CSIC, Spain)
A Class of Binary Sequences with Large Linear Complexity. Abstract - 4.- O. Geil , S. Martin (AAU, Denmark)
Further Improvements on the Feng-Rao Bound for Dual Codes. Abstract - 5.- T. Høholdt, F. Piñero (DTU, Denmark), P. Zeng (ECNU, China)
Some Optimal Codes as Tanner Codes with BCH Component Codes Abstract - 6.- H. Kai, M. Yamada (Ehime-u, Japan)
A secret sharing scheme using Gröbner basis. Abstract - 7.- I. Márquez-Corbella (UVa, Spain), R. Pellikaan (TUE, Nederlands)
Error-correcting pairs and arrays from algebraic geometry codes. Abstract - 8.- E. Martínez-Moro, A.P. Nicolás (UVa, Spain), I.F. Rua (UniOvi, Spain)
Additive multivariable codes over F4. Abstract - 9.- E. Martínez-Moro, A.P. Nicolás, E. Suárez-Canedo (UVa, Spain)
On Generalized Lee Weigth Codes over Dihedral Groups. Abstract - 10.- C. Munuera (UVa, Spain), W. Olaya (UIS, Colombia)
Decoding of codes for applications to steganography. Abstract - 11.- M. Polak, V. Ustymenko
(UMCS.Lublin, Poland)
On LDPC codes corresponding to new families of regular expanding graphs of large girth. Abstract - 12.- J. Pujol, M. Villanueva, F. Zeng
(UAB, Spain)
Representation, constructions and minimum distance computation of binary nonlinear codes. Abstract - 13.- U. Romańczuk, V. Ustymenko
(UMCS.Lublin, Poland)
On regular forests given in terms of algebraic geometry, new families of expanding graphs with large girth and new multivariate cryptographical algorithms. Abstract - 14.- T. Shaska (Oakland, US), C. Shor (WNE, US)
Some remarks for codes and lattices over imaginary quadratic fields Abstract - 15.- Y. Sun, Z. Huang, D. Lin, D. Wang (ISCAS, China)
An Efficient Algorithm for Computing Branch Groebner Systems and Its Applications in Algebraic Cryptanalysis. Abstract - 16.- V. Ustymenko, A. Wroblewska
(UMCS.Lublin, Poland)
On some algebraic aspects of data security in cloud computing. Abstract
Special Issue
There will be a Special Issue of the journal Designs, Codes and Cryptography devoted to the topics of session having the organizers as guest editors. The authors of
the extended abstracts accepted will be invited to submit their full revised papers for publication.More information about the special issue
will be shown in this webpage soon