Canada Spends Logo

Explore our Budget 2026 analysis

Grant: Discovery Grants Program - Individual

Carleton University

$27,000.00

Finite Fields and applications in coding theory and cryptography

FY 2024-25

Summary
The proposed research is in finite fields and their applications. My recent research has centered on the theoretical study of objects/structures and their properties over finite fields, as well as  their applications to other branches of mathematics and information theory. These objects include polynomials and sequences over finite fields, which have a large number of applications in coding theory, combinatorics, communications, and cryptography. This research program is a fascinating and vibrant area of research in the intersection of discrete math, number theory, theoretical computer science, and information theory. Many open problems and conjectures arise from useful problems in coding theory and cryptography. Although much significant progress has been made on several outstanding problems in recent years, many pertinent problems remain open. It is my long term vision to make a significant and lasting contribution to this area of research. The combinatorial properties of polynomials such as permutation and value set sizes, arithmetic properties of polynomials such as irreducibility, primitivity, divisibility and factorization, as well as the pseudorandomness of sequences, are central topics of fundamental research. For example, there has been an increasing demand for further studies of objects such as permutation polynomials (PPs), irreducible polynomials, primitive polynomials, special functions, and feedback shift register (FSR) sequences due to their applications in block ciphers and stream ciphers, as well as signal sets in wireless communications. Indeed, the design of good S-boxes (permutations) which are resistant against linear/differential cryptanalysis requires useful special functions such as almost perfect nonlinear (APN) permutations over finite fields; improving the complexity of list decoding algorithms requires the further study of polynomials with prescribed ranges; the design of reliable stream ciphers requires good pseudorandom sequences; the implementation of linear feedback shift register (LFSR) sequences requires the existence of primitive polynomials with certain low weight (i.e., 3 or 5 nonzero coefficients) over the binary field. My long term goal is thus two-fold: 1) to better understand the combinatorial and arithmetic properties of these fundamental objects over finite fields, and their construction, distribution, and enumeration; 2) to better understand the interplay among different objects and properties over finite fields and find genuine applications in constructing good codes and ciphers.  We expect that original and significant contributions will be made for the proposed research, in advancing knowledge in the theory of finite fields and applications in other branches of mathematics and information theory.  Positive solutions to some of these problems would not only have significant impact on the research community but also directly impact technology advances in Communications and Cybersecurity of Canada.
Program
Discovery Grants Program - Individual
Location
Ontario, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data

As published

Application id
RGPIN-2023-04673
Name nom
Wang, Qiang (Steven)
Department département
Math & Stats
Organization id
23
Institution établissement
Carleton University
Province en
Ontario
Province fr
Ontario
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2024
Competition year année de concours
2023
Award amount
27000
Program id
RGPIN
Program name en
Discovery Grants Program - Individual
Program name fr
Programme de subventions à la découverte - individuelles
Group en
DISCOVERY RESEARCH
Group fr
RECHERCHE AXÉE SUR LA DÉCOUVERTE
Committee code
1508
Committee name en
Mathematics and Statistics
Committee name fr
Mathématiques et statistique
Area of application code
1205
Area of application group en
Advancement of knowledge
Area of application group fr
Avancement des connaissances
Area of application en
Mathematical sciences
Area of application fr
Sciences mathématiques
Research subject code
2914
Research subject group en
Pure mathematics
Research subject group fr
Mathématiques pures
Research subject en
Combinatorics
Research subject fr
Combinatoire
Field of research list names en
Not available
Field of research list names fr
Non disponible
Socioeconomic objective list names en
Not available
Socioeconomic objective list names fr
Non disponible
Application title
Finite Fields and applications in coding theory and cryptography
Keywords
finite fields; permutation polynomials; irreducible polynomials; primitive polynomials; shift register sequences; pseudo-random sequences; complete mappings; linear codes; s-boxes; stream ciphers
Application summary
The proposed research is in finite fields and their applications. My recent research has centered on the theoretical study of objects/structures and their properties over finite fields, as well as  their applications to other branches of mathematics and information theory. These objects include polynomials and sequences over finite fields, which have a large number of applications in coding theory, combinatorics, communications, and cryptography. This research program is a fascinating and vibrant area of research in the intersection of discrete math, number theory, theoretical computer science, and information theory. Many open problems and conjectures arise from useful problems in coding theory and cryptography. Although much significant progress has been made on several outstanding problems in recent years, many pertinent problems remain open. It is my long term vision to make a significant and lasting contribution to this area of research. The combinatorial properties of polynomials such as permutation and value set sizes, arithmetic properties of polynomials such as irreducibility, primitivity, divisibility and factorization, as well as the pseudorandomness of sequences, are central topics of fundamental research. For example, there has been an increasing demand for further studies of objects such as permutation polynomials (PPs), irreducible polynomials, primitive polynomials, special functions, and feedback shift register (FSR) sequences due to their applications in block ciphers and stream ciphers, as well as signal sets in wireless communications. Indeed, the design of good S-boxes (permutations) which are resistant against linear/differential cryptanalysis requires useful special functions such as almost perfect nonlinear (APN) permutations over finite fields; improving the complexity of list decoding algorithms requires the further study of polynomials with prescribed ranges; the design of reliable stream ciphers requires good pseudorandom sequences; the implementation of linear feedback shift register (LFSR) sequences requires the existence of primitive polynomials with certain low weight (i.e., 3 or 5 nonzero coefficients) over the binary field. My long term goal is thus two-fold: 1) to better understand the combinatorial and arithmetic properties of these fundamental objects over finite fields, and their construction, distribution, and enumeration; 2) to better understand the interplay among different objects and properties over finite fields and find genuine applications in constructing good codes and ciphers.  We expect that original and significant contributions will be made for the proposed research, in advancing knowledge in the theory of finite fields and applications in other branches of mathematics and information theory.  Positive solutions to some of these problems would not only have significant impact on the research community but also directly impact technology advances in Communications and Cybersecurity of Canada.
Carleton University - $27,000 Grant (2024-25) | Canada Spends