Canada Spends Logo

Explore our Budget 2026 analysis

Grant: Discovery Grants Program - Individual

Queen's University

$33,000.00

The design and analysis of coding algorithms for reliable and secure digital communications

FY 2010-11

Summary
Information technology relies heavily upon error-correcting codes and cryptographic protocols to ensure the reliable and secure transmission and storage of information. Error-correcting codes are used universally for sending packets over the web, in writing data on CDs and flash memory devices, and other similar means of modern communication. Secret-sharing schemes are protocols that allow for the secure storage of cryptographic keys, and for secure multiparty computation, in which a group of participants want to compute an agreed function of their private data without in any way compromising the privacy of their data. Modern error-correcting coding schemes use iterative decoding algorithms that are based on graphical models, which bring the error-correction performance of the codes close to the optimum predicted by theory. One of the goals of this research is to develop graph-based iterative decoding algorithms having low implementation complexity for such well-known code families as Reed-Muller and BCH codes. Our approach for this is to use tools from the mathematical theories of graphs and matroids to analyze the complexity of graphical models, which then allows for an analysis of the complexity of the associated decoding algorithms. Many of the same mathematical tools can be used in the design and analysis of secret-sharing schemes. In this context, this research addresses the issue of finding secret-sharing schemes with the optimal information rate for a specified set of security requirements. The proposed research aims to impact the information and communications technology sector in three ways: (i) by providing the sector with new low-complexity error-correcting coding schemes; (ii) by developing design techniques for optimal secret-sharing protocols that meet a given set of security requirements; and (iii) by training highly qualified personnel in techniques essential for research and development in this sector.
Program
Discovery Grants Program - Individual
Location
Ontario, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data

As published

Application id
311816-2010
Name nom
Kashyap, Navin
Department département
Mathematics and Statistics
Organization id
29
Institution établissement
Queen's University
Province en
Ontario
Province fr
Ontario
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2010
Competition year année de concours
2010
Award amount
33000
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
1510
Committee name en
Electrical and Computer Engineering
Committee name fr
Génie électrique et informatique
Area of application code
802
Area of application group en
Information and communication services
Area of application group fr
Services d'information et de télécommunications
Area of application en
Information systems and technology
Area of application fr
Systèmes d'information et technologie de l'information
Research subject code
2718
Research subject group en
Information technology
Research subject group fr
Technologie de l'information
Research subject en
Communication and information theory
Research subject fr
Théorie des télécommunications et de l'information
Partie
1
Nb partie
5
Application title
The design and analysis of coding algorithms for reliable and secure digital communications
Keyword
NSERC
Application summary
Information technology relies heavily upon error-correcting codes and cryptographic protocols to ensure the reliable and secure transmission and storage of information. Error-correcting codes are used universally for sending packets over the web, in writing data on CDs and flash memory devices, and other similar means of modern communication. Secret-sharing schemes are protocols that allow for the secure storage of cryptographic keys, and for secure multiparty computation, in which a group of participants want to compute an agreed function of their private data without in any way compromising the privacy of their data. Modern error-correcting coding schemes use iterative decoding algorithms that are based on graphical models, which bring the error-correction performance of the codes close to the optimum predicted by theory. One of the goals of this research is to develop graph-based iterative decoding algorithms having low implementation complexity for such well-known code families as Reed-Muller and BCH codes. Our approach for this is to use tools from the mathematical theories of graphs and matroids to analyze the complexity of graphical models, which then allows for an analysis of the complexity of the associated decoding algorithms. Many of the same mathematical tools can be used in the design and analysis of secret-sharing schemes. In this context, this research addresses the issue of finding secret-sharing schemes with the optimal information rate for a specified set of security requirements. The proposed research aims to impact the information and communications technology sector in three ways: (i) by providing the sector with new low-complexity error-correcting coding schemes; (ii) by developing design techniques for optimal secret-sharing protocols that meet a given set of security requirements; and (iii) by training highly qualified personnel in techniques essential for research and development in this sector.