CONFERENCE
ALCOCRYPT
ALgebraic and combinatorial methods for COding and CRYPTography
Méthodes algébriques et combinatoires pour le codage et la cryptographie
20 – 24 February 2023
Scientific Committee
Comité scientifique
Alexis Bonnecaze (Aix-Marseille Université)
Eimear Byrne (University College Dublin)
Nadia El Mrabet (Mines Saint-Etienne et Gardanne)
Philippe Gaborit (Université de Limoges)
Sihem Mesnager (Université de Paris VIII et Paris XIII)
Patrick Solé (CNRS-Aix-Marseille Université)
Alfred Wassermann ( University of Bayreuth)
Organizing Committee
Comité d’organisation
Alexis Bonnecaze (Aix-Marseille Université)
Sihem Mesnager (Université de Paris VIII et Paris XIII)
Patrick Solé (CNRS-Aix-Marseille Université)
This conference is devoted to the algebraic and combinatorial aspects of codes and cryptography and the links between codes and cryptography. It aims at gathering international experts, including researchers from the University of Aix-Marseille, in this essential and very active field of mathematics and theoretical computer science. This event aims also to provide a forum for researchers working on algebraic and combinatorial methods for coding and cryptography, exchange ideas and interests in open problems, and further explore their applications in cryptography error-correcting codes and communications. We plan to issue a ”Call for Paper” for specialized talks and select some presentations to be published in the congress proceedings in the international journal Advances in Mathematics of Communications édited by American Institute of Mathematical Sciences and handled by Jintai Ding and Sihem Mesnager as Editors-in-Chief.
Cette conférence est consacrée aux aspects algébriques et combinatoires des codes et de la cryptographie et aux liens entre les codes et la cryptographie. Elle vise à rassembler des experts internationaux, dont des chercheurs de l’Université d’Aix-Marseille, dans ce domaine essentiel et très actif des mathématiques et de l’informatique théorique. Cet événement vise également à fournir un forum pour les chercheurs travaillant sur les méthodes algébriques et combinatoires pour le codage et la cryptographie, à échanger des intérêts et des idées sur des problèmes ouverts, et à explorer davantage leurs applications en cryptographie, codes correcteurs d’erreurs et communications. Nous prévoyons de lancer un « appel à communications » pour les exposés spécialisés et de sélectionner certaines présentations qui seront publiées dans les actes du congrès dans la revue internationale « Advances in Mathematics of Communications » éditée par l’American Institute of Mathematical Sciences et dont les rédacteurs en chef sont Jintai Ding et Sihem Mesnager.
PLENARY SPEAKERS
Stefka Bouyuklieva (Veliko Tarnovo University) On the Structure of the Linear Codes with a Given Automorphism
Lilya Budaghyan (University of Bergen) On APN and AB Power Functions
Camilla Hollanti (Aalto University) Almost There: Capacity of Private Information Retrieval from Coded and Colluding Servers
Sascha Kurz (University of Bayreuth) Divisible Codes
Itzhak Tamo (Tel Aviv University) Nonlinear Repair Schemes of Reed-Solomon Codes
CONTRIBUTED TALKS
Knud Ahrens (University of Passau) Sieving for large twin smooth integers using single solutions to Prouhet-Tarry-Escott
Iliya Bouyukliev (Bulgarian Academy of Sciences) Dual transform and projective self-dual codes
Eimear Byrne (University College Dublin) q-Matroids, their Cyclic Flats and Relations to Codes
Claude Carlet (Université Sorbonne Paris Nord) On the APNness and differential uniformity of some classes of (n, n)-functions over F2^n
Tymoteusz Chojecki (Marie Curie-Sklodowska University in Lublin) On recent results on algebraic constructions of Extremal Graph Theory and their impact on graph based coding and cryptography algorithms
Ingo Czerwinski (Otto von Guericke University Magdeburg) Sidon sets, sum-free sets and linear codes
Cristina Fernández-Córdoba (Autonomous University of Barcelona) Equivalences among Z_{p^s}-linear generalized Hadamard codes
Andrew Fulcher (University College Dubin) The tutte polynomial of a q-matroid
Kirpa Garg (Indian Institute of Technology Jammu) The c-differential uniformity of some classes of permutation polynomials
Cem Guneri (Sabanci University) On binary linear complementary pairs of codes
Sudhir Ghorpade (Indian Institute of Technology Bombay) Projective Reed Muller Codes Revisited
Kenza Guenda (Université des Sciences et de la Technologie Houari Boumédiène) On Some Matrices and Their Application to Code Construction
Theresa Körner (University of Bayreuth) Lengths of divisible codes
Dimitri Koshelev (ENS Lyon) Some remarks on how to hash faster onto elliptic curves
Philippe Langevin (Université de Toulon) Covering radius of RM(4; 8)
Julia Lieb (University of Zurich) A novel criterion for the construction of MDS convolutional codes of rate 1/n
Krishna Mallick (National Institute of Science Education and Research) A Class of Weightwise Almost Perfectly Balanced Boolean Functions
Edgar Martinez-Moro (University of Valladolid) Complete Grobner basis associated to lattice codes
Andrew Mendelsohn (Imperial College) Non-norm Elements for Cryptography
Rohini More (VIT-AP University) Optimal Binary Hierarchical poset code Having Hull Dimension One
Alessandro Neri (Ghent University) Higher degrees symmetric Rank-Metric codes
Ferruh Ozbudak (Middle East Technical University) Quasi-twisted codes as contractions of quasi-cyclic codes
François Palma (Université de Toulon) Pms for large integers: revisiting the internal Montgomery reduction
Daniel Panario (Carleton University) Quantum QC-LDPC Codes with large girth
Sanja Rukavina (University of Rijeka) On extremal ternary self-dual codes of length 36 and related symmetric 2-(36; 15; 6)
Vidya Sagar (Indian Institute of Technology Delhi) Certain binary minimal codes constructed using simplicial complexes
Hatoon Shoaib (King Abdulaziz University) Double Circulant Additive Complementary Dual Codes over F4
Sartaj Ul Hasan (Indian Institute of Technology Jammu) The differential properties of certain permutation polynomials over finite fields
Gyanendra K. Verma (Indian Institute of Technology Delhi) Additive Complementary Dual Codes Over Fq^2
Nadja Willenborg (University of St. Gallen) Asymptotic Density Results for Lee Metric Codes
Oğuz Yayla (Middle East Technical University) Delegated Verifiable Accountable Subgroup Multi-signatures
Performance improvement of white-box algorithms using lightweight components
Ferdinando Zullo (University of Campania « Luigi Vanvitelli ») Left ideal LRPC codes and a ROLLO-type cryptosystem based on group algebras
SPONSORS
