Welcome to the resource topic for 2022/908
Title:
On fast computations of numerical parameters of homogeneous algebraic graphs of large girth and small diameter and encryption of large files.
Authors: Tymoteusz Chojecki and Vasyl Ustimenko
Abstract:The paper is dedicated to computer evaluation of parameters of members of family A(n, F_q) , n ≥ 2 of small world algebraic graphs of large girth with well defined projective limit. We present the applications of these computations to some optimisation problems for algebraic graphs over various field and Cryptography. We show the impact of high girth property of known family of graphs A(n, F_q) on properties of fast stream ciphers based on these graphs. Finally we modify these symmrtric encryption algorithms to make them resistant to linearization attacks.
ePrint: https://eprint.iacr.org/2022/908
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .