Canada Spends Logo

Explore our Budget 2026 analysis

Grant: Discovery Grants Program - Individual

University of Calgary

$14,000.00

Algorithms and cryptography in algebraic function fields

FY 2008-09

Summary
The last few decades have seen an unprecedented increase in the use of computing and communication technology. Throughout the world, the amount of data that is being transmitted over unprotected channels, such as the internet and mobile telephones, is increasing at a staggering rate. In addition, the number of large scale databases containing possibly sensitive records is continuing to grow. Unfortunately, this development is coupled with an ever rising threat of unauthorized access to (and possibly modification of) information that was assumed to be safe from such intrusions. Sadly, the public has gotten quite accustomed to news flashes about virus-infected computers, internet worms, defaced web sites, and cases of identity theft. One of the most effective ways of protecting data against unauthorized access is to scrample (encrypt) it before sending or storing it, thereby rendering it unintelligible to prying eyes. Only authorized parties are able to unscramble (decrypt) the information with the aid of a secret key known only to them. A cryptographic system, or cryptosystem for short, is a method for effecting this process. The security of many modern cryptosystems relies on certain mathematical problems that experts believe to be extremely difficult to solve. The idea underlying the design of such a system is that an adversary would have to solve an instance of one of these very hard problems in order to crack the scheme. It is therefore of great interest, both theoretical and practical, to thoroughly study these types of problems and devise new cryptosystems that make use of them. To this end, I propose to investigate a type of mathematical structure called an algebraic function field. Due to their fast arithmetic and their wealth of built-in hard mathematical problems, these structures provide an excellent framework for efficient and very secure cryptosystems. Some function field based schemes -- namely the so-called elliptic curve based cryptosystems -- are already used commercially on a variety of electronic devices, such as computers, personal data organizers, and cell phones.
Program
Discovery Grants Program - Individual
Location
Alberta, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data

As published

Application id
250246-2006
Name nom
Scheidler, Renate
Department département
Mathematics and Statistics
Organization id
11
Institution établissement
University of Calgary
Province en
Alberta
Province fr
Alberta
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2008
Competition year année de concours
2006
Award amount
14000
Program id
RGPIN
Program nane 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
336
Committee name en
Pure & Applied Maths - A
Committee name fr
Maths pures et appliquées - A
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
3
Nb partie
5
Application title
Algorithms and cryptography in algebraic function fields
Keyword
NA
Application summary
The last few decades have seen an unprecedented increase in the use of computing and communication technology. Throughout the world, the amount of data that is being transmitted over unprotected channels, such as the internet and mobile telephones, is increasing at a staggering rate. In addition, the number of large scale databases containing possibly sensitive records is continuing to grow. Unfortunately, this development is coupled with an ever rising threat of unauthorized access to (and possibly modification of) information that was assumed to be safe from such intrusions. Sadly, the public has gotten quite accustomed to news flashes about virus-infected computers, internet worms, defaced web sites, and cases of identity theft. One of the most effective ways of protecting data against unauthorized access is to scrample (encrypt) it before sending or storing it, thereby rendering it unintelligible to prying eyes. Only authorized parties are able to unscramble (decrypt) the information with the aid of a secret key known only to them. A cryptographic system, or cryptosystem for short, is a method for effecting this process. The security of many modern cryptosystems relies on certain mathematical problems that experts believe to be extremely difficult to solve. The idea underlying the design of such a system is that an adversary would have to solve an instance of one of these very hard problems in order to crack the scheme. It is therefore of great interest, both theoretical and practical, to thoroughly study these types of problems and devise new cryptosystems that make use of them. To this end, I propose to investigate a type of mathematical structure called an algebraic function field. Due to their fast arithmetic and their wealth of built-in hard mathematical problems, these structures provide an excellent framework for efficient and very secure cryptosystems. Some function field based schemes -- namely the so-called elliptic curve based cryptosystems -- are already used commercially on a variety of electronic devices, such as computers, personal data organizers, and cell phones.