Grant: Discovery Grants Program - Individual
Carleton University
$12,000.00
finite fields and their applications
FY 2013-14
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 on their applications to other branches of mathematics, computer science, and information theory. These objects include polynomials/functions/sequences over finite fields, which have a large number of applications in coding theory, combinatorics, communications and cryptography. The permutation behavior and arithmetic properties of polynomials such as factorization, divisibility, irreducibility and primitivity, as well as the pseudo-randomness of sequences, are central topics of fundamental research. Indeed, 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. For example, the design of reliable stream ciphers requires good pseudo-random sequences; 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. My long term goal is thus two-fold: 1) to betterunderstand the permutation behavior and arithmetic properties of these polynomials/functions 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, combinatorial designs, signal sets for wireless communications and S-boxes. My scientific approach requires not only extensively theoretical efforts, but also massive computational experiments. This quest involves a combination of knowledge from combinatorics, number theory, algebra, computer science, and information theory.
Program
Discovery Grants Program - Individual
Recipient
Location
Ontario, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data
As published
Application id
312588-2012
Name nom
Wang, Qiang(Steven)
Department département
Mathematics and Statistics, School of
Organization id
23
Institution établissement
Carleton University
Province en
Ontario
Province fr
Ontario
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2013
Competition year année de concours
2012
Award amount
12000
Program id
RGPIN
Program name en
Discovery Grants Program - Individual
Program name fr
Programme de subventions à la découverte - individuelles
Group en
Discovery grants programs
Group fr
Programmes de subventions à 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
2913
Research subject group en
Pure mathematics
Research subject group fr
Mathématiques pures
Research subject en
Number theory
Research subject fr
Théorie des nombres
Partie
2
Nb partie
5
Application title
finite fields and their applications
Keyword
NSERC
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 on their applications to other branches of mathematics, computer science, and information theory. These objects include polynomials/functions/sequences over finite fields, which have a large number of applications in coding theory, combinatorics, communications and cryptography. The permutation behavior and arithmetic properties of polynomials such as factorization, divisibility, irreducibility and primitivity, as well as the pseudo-randomness of sequences, are central topics of fundamental research. Indeed, 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. For example, the design of reliable stream ciphers requires good pseudo-random sequences; 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. My long term goal is thus two-fold: 1) to betterunderstand the permutation behavior and arithmetic properties of these polynomials/functions 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, combinatorial designs, signal sets for wireless communications and S-boxes. My scientific approach requires not only extensively theoretical efforts, but also massive computational experiments. This quest involves a combination of knowledge from combinatorics, number theory, algebra, computer science, and information theory.