Hi! My name is Luiz, and I am an undergraduate student in Computer Science at the Federal University of Santa Catarina (UFSC). I am actively involved in academic research focusing on combinatorial designs, algorithms, and cryptographic applications—areas in which I have a strong passion and interest. Throughout my academic journey, I have participated in various laboratories and projects, including research initiatives, web and mobile development, and other academic activities. I am focused, motivated, and committed to continuous learning and to creating innovative and impactful solutions.
Engaged in academic research on combinatorics mathematics applied to cryptography. I explore combinatorial designs in group testing, specifically constructions of Cover-Free Families (CFFs), focusing on polynomial constructions over finite fields and exploring other designs. My work addresses both the theoretical aspects—generalizing and proposing new designs—and their efficient implementation in C.
Worked as a QA Intern at Laboratório Bridge. In this role, I was responsible for the planning and modeling of test cases, as well as setting up the necessary testing environments. My daily tasks involved executing both automated and exploratory tests, analyzing and correcting execution errors, and reporting found incidents to ensure the reliability and quality of the software products.
Participated in the Tutorial Education Program (PET) at UFSC. During this period, I engaged in various activities focused on the integration of teaching, research, and extension. My responsibilities included providing academic support to fellow students through tutoring focused on course content, developing community-oriented projects, contributing to the development of a web platform for a UFSC sector, and participating in the organization of academic events, such as the Computer Science Academic Week, supporting both technical and organizational activities. This experience strengthened my communication skills, leadership abilities, and commitment to social impact through technology.
A high-performance C implementation of unbounded Cover-Free Families (CFFs) based on polynomial constructions over finite fields. This project focuses on implementing both embedding families and monotone families of CFFs. The implementation employs an optimized strategy of pre-calculating polynomial evaluations and storing them in a nested hash map to efficiently build the CFF binary matrix, a technique referred to as inverted indexes. Additionally, a paper has been produced generalizing the construction of the embedding family and detailing this practical implementation.
Loading publications...
Embedding Cover-Free Families (CFFs): Implementation and Applications in Cryptography
The 16th International Conference on Finite Fields and their Applications, São Carlos, Brazil, July 2025.