Canada Spends Logo

Explorez notre analyse du budget 2026

Grant: Discovery Grants Program - Individual

University of Waterloo

$36,300.00

Cryptographic computations: algorithms, architectures, and assurances

EF 2007-08

Résumé
In order to provide security for communications and computers, various cryptographic schemes can be used.  Many of these schemes require special type of computations, e.g., point addition on elliptic curves, which deal with very large and abstract operands, such as elements of finite fields. Such computations are not directly supported by main stream processors, and require special representations, algorithms and hardware architectures. For practical applications, these algorithms and architectures are to meet performance requirements under various constraints, such as limited area, narrow bandwidth, and low power. More importantly, they need to operate in a way so that they do not leak information related to the secret key of the cryptosystem through various side channels, such as power consumption signals, electromagnetic emanations, and erroneous outputs caused by faults induced deliberately by a malicious attacker. The main objective of the research is to investigate various aspects of cryptographic computations that extent from digital signature generation by elliptic curve point addition to basic field arithmetic, and are at the heart of many security schemes used in communications and computers. Under the proposed research, we plan to work towards the development of novel algorithms and hardware architectures for such computations. The algorithm development is envisioned to be quite challenging and is expected to be largely influenced by properties of the underlying mathematical structures and can be quite abstract for field arithmetic. Efforts for mapping of algorithms onto hardware will take into account implementation platforms, target applications, and more importantly, various architectural challenges that are quite significant owing to very large size operands used in cryptography. In addition, considerable efforts will be required so that critical cryptographic computations are resistant against various side-channel attacks.
Programme
Discovery Grants Program - Individual
Emplacement
Ontario, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data

Tel que publié

Application id
155507-2006
Name nom
Hasan, Anwarul
Department département
Electrical & Computer Engineering
Organization id
33
Institution établissement
University of Waterloo
Province en
Ontario
Province fr
Ontario
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2007
Competition year année de concours
2006
Award amount
36300
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
334
Committee name en
Commun.,Computers & Components
Committee name fr
Communic.,ordin. et composants
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
2700
Research subject group en
Information technology
Research subject group fr
Technologie de l'information
Research subject en
Information technology
Research subject fr
Technologie de l'information
Partie
2
Nb partie
5
Application title
Cryptographic computations: algorithms, architectures, and assurances
Keyword
NA
Application summary
In order to provide security for communications and computers, various cryptographic schemes can be used.  Many of these schemes require special type of computations, e.g., point addition on elliptic curves, which deal with very large and abstract operands, such as elements of finite fields. Such computations are not directly supported by main stream processors, and require special representations, algorithms and hardware architectures. For practical applications, these algorithms and architectures are to meet performance requirements under various constraints, such as limited area, narrow bandwidth, and low power. More importantly, they need to operate in a way so that they do not leak information related to the secret key of the cryptosystem through various side channels, such as power consumption signals, electromagnetic emanations, and erroneous outputs caused by faults induced deliberately by a malicious attacker. The main objective of the research is to investigate various aspects of cryptographic computations that extent from digital signature generation by elliptic curve point addition to basic field arithmetic, and are at the heart of many security schemes used in communications and computers. Under the proposed research, we plan to work towards the development of novel algorithms and hardware architectures for such computations. The algorithm development is envisioned to be quite challenging and is expected to be largely influenced by properties of the underlying mathematical structures and can be quite abstract for field arithmetic. Efforts for mapping of algorithms onto hardware will take into account implementation platforms, target applications, and more importantly, various architectural challenges that are quite significant owing to very large size operands used in cryptography. In addition, considerable efforts will be required so that critical cryptographic computations are resistant against various side-channel attacks.