Canada Spends Logo

Explore our Budget 2026 analysis

Grant: Discovery Grants Program - Individual

Carleton University

$36,000.00

Computations in finite fields and probabilistic analysis of algorithms

FY 2013-14

Summary
The overall area of my research is the design and analysis of algorithms. My recent research has centered around two lines: the investigation of algorithms in finite fields and their applications in modern communication areas, and the study of algorithms when randomness is considered. A main area of my research involves computations in finite fields and their applications. Algorithms that work with finite fields play a crucial role in innumerous practical applications in communications, cryptography, coding theory and information theory. My goal in this area is the design of efficient algorithms in finite fields, and the usage of elements from the theory of finite fields in engineering applications. Examples are efficient implementation of arithmetic using polynomials and normal elements, and constructions of certain types of polynomials over finite fields (irreducible, primitive, among others). The main applications of these studies are in cryptography, with other areas including codes and combinatorial constructions.My second line of research is the probabilistic analysis of algorithms that comprises the study of algorithms when randomness is used. In particular, average-case analysis of algorithms focuses on understanding the behaviour of algorithms on random inputs. An essential goal of the area is to advance in the understanding of randomness. Immediate goals are better understanding of particular algorithms, and the development of new efficient algorithms based on this knowledge. The scientific approach is based on mathematical proofs involving generating functions for counting the properties of interest for the analysis of the algorithms, and asymptotic analysis. My goal in this area is two-fold: to develop algorithms for fundamental problems like searching with better performance than previously known algorithms, and to contribute to the mathematical understanding of random polynomials over finite fields.
Program
Discovery Grants Program - Individual
Location
Ontario, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data

As published

Application id
238757-2013
Name nom
Panario, Daniel
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
2013
Award amount
36000
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
1507
Committee name en
Computer Science
Committee name fr
Sciences informatiques
Area of application code
1200
Area of application group en
Advancement of knowledge
Area of application group fr
Avancement des connaissances
Area of application en
Advancement of knowledge
Area of application fr
Avancement des connaissances
Research subject code
2713
Research subject group en
Information technology
Research subject group fr
Technologie de l'information
Research subject en
Algorithms
Research subject fr
Algorithmes
Partie
1
Nb partie
5
Application title
Computations in finite fields and probabilistic analysis of algorithms
Keyword
NSERC
Application summary
The overall area of my research is the design and analysis of algorithms. My recent research has centered around two lines: the investigation of algorithms in finite fields and their applications in modern communication areas, and the study of algorithms when randomness is considered. A main area of my research involves computations in finite fields and their applications. Algorithms that work with finite fields play a crucial role in innumerous practical applications in communications, cryptography, coding theory and information theory. My goal in this area is the design of efficient algorithms in finite fields, and the usage of elements from the theory of finite fields in engineering applications. Examples are efficient implementation of arithmetic using polynomials and normal elements, and constructions of certain types of polynomials over finite fields (irreducible, primitive, among others). The main applications of these studies are in cryptography, with other areas including codes and combinatorial constructions.My second line of research is the probabilistic analysis of algorithms that comprises the study of algorithms when randomness is used. In particular, average-case analysis of algorithms focuses on understanding the behaviour of algorithms on random inputs. An essential goal of the area is to advance in the understanding of randomness. Immediate goals are better understanding of particular algorithms, and the development of new efficient algorithms based on this knowledge. The scientific approach is based on mathematical proofs involving generating functions for counting the properties of interest for the analysis of the algorithms, and asymptotic analysis. My goal in this area is two-fold: to develop algorithms for fundamental problems like searching with better performance than previously known algorithms, and to contribute to the mathematical understanding of random polynomials over finite fields.
Carleton University - $36,000 Grant (2013-14) | Canada Spends