Canada Spends Logo

Explore our Budget 2026 analysis

Grant: Discovery Grants Program - Individual

University of Western Ontario

$25,000.00

Efficient and reliable computations for lightweight and/or high-performance cryptosystems: algorithms, architectures, designs and implementations

FY 2017-18

Summary
With rapid advances in information, computer and communication technologies and systems, huge amount of data has to be processed, stored and exchanged among users, which makes data integrity and information security very important issues. To protect the data and make it secure, various cryptographic primitives are being incorporated in many standards and protocols and implemented in a wide range of platforms; from powerful computers used in servers and base stations to lightweight cryptosystems used in wireless devices. The performance of cryptosystems rely heavily on efficient cryptographic computations, specially in resource constrained embedded systems, such as smart cards, RFID tags, Internet of Things, and nodes in wireless sensor networks, where the power consumption, memory, and bandwidth are very limited. Reliable and efficient design and implementation of cryptographic computations are challenging due to their complex nature. The main objectives of the research are summarized as follows: (i) We will investigate the development of new efficient algorithms and architectures for finite field arithmetic operations, such as multiplication, squaring, inversion, and exponentiation in binary extension fields using polynomial, shifted polynomial and Gaussian normal basis representations. We will consider their designs and implementations in ASICs and FPGAs. For each and every working platform, we plan to further optimize these operations for both lightweight and high-performance applications to have low-resource and/or high-speed computations. (ii) We will study the designs and implementations of a number of public and private key cryptosystems based on our newly proposed multipliers. Finite field multiplication is the main arithmetic operation used in elliptic curve and exponentiation-based cryptosystems, the AES-GCM authenticated encryption and the WG stream cipher. The effects of using different digit-level multipliers will be investigated to further optimize these cryptosystems for two-end applications namely, lightweight and high-performance cryptosystems. (iii) We will explore new reliable and robust schemes for private and public key cryptosystems to counteract natural faults and fault attacks. This research is very important due to the fact that fault attacks have become a serious concern in cryptographic applications. The research will be based on adopting efficient concurrent error control coding approaches with low overhead and acceptable error detection capability. This research will lead to more secure and reliable cryptosystems with lower cost and higher performance. It will also significantly contribute to training highly qualified personnel for academia and a large number of companies in the Canadian Information and Communications Technologies (ICT) sector.
Program
Discovery Grants Program - Individual
Location
Ontario, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data

As published

Application id
RGPIN-2015-04899
Name nom
ReyhaniMasoleh, Arash
Department département
Electrical and Computer Engineering - Electrical and Computer Engineering
Organization id
36
Institution établissement
University of Western Ontario
Province en
Ontario
Province fr
Ontario
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2017
Competition year année de concours
2015
Award amount
25000
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
513
Area of application group en
Manufacturing processes and products
Area of application group fr
Procédés et produits industriels
Area of application en
Electrical and electronic machinery and equipment (including computer hardware)
Area of application fr
Machinerie et équipement électriques et électroniques (y compris matériel informatique)
Research subject code
2719
Research subject group en
Information technology
Research subject group fr
Technologie de l'information
Research subject en
Computer architecture and design
Research subject fr
Architecture d'ordinateur et conception
Partie
3
Nb partie
5
Application title
Efficient and reliable computations for lightweight and/or high-performance cryptosystems: algorithms, architectures, designs and implementations
Keyword
NSERC
Application summary
With rapid advances in information, computer and communication technologies and systems, huge amount of data has to be processed, stored and exchanged among users, which makes data integrity and information security very important issues. To protect the data and make it secure, various cryptographic primitives are being incorporated in many standards and protocols and implemented in a wide range of platforms; from powerful computers used in servers and base stations to lightweight cryptosystems used in wireless devices. The performance of cryptosystems rely heavily on efficient cryptographic computations, specially in resource constrained embedded systems, such as smart cards, RFID tags, Internet of Things, and nodes in wireless sensor networks, where the power consumption, memory, and bandwidth are very limited. Reliable and efficient design and implementation of cryptographic computations are challenging due to their complex nature. The main objectives of the research are summarized as follows: (i) We will investigate the development of new efficient algorithms and architectures for finite field arithmetic operations, such as multiplication, squaring, inversion, and exponentiation in binary extension fields using polynomial, shifted polynomial and Gaussian normal basis representations. We will consider their designs and implementations in ASICs and FPGAs. For each and every working platform, we plan to further optimize these operations for both lightweight and high-performance applications to have low-resource and/or high-speed computations. (ii) We will study the designs and implementations of a number of public and private key cryptosystems based on our newly proposed multipliers. Finite field multiplication is the main arithmetic operation used in elliptic curve and exponentiation-based cryptosystems, the AES-GCM authenticated encryption and the WG stream cipher. The effects of using different digit-level multipliers will be investigated to further optimize these cryptosystems for two-end applications namely, lightweight and high-performance cryptosystems. (iii) We will explore new reliable and robust schemes for private and public key cryptosystems to counteract natural faults and fault attacks. This research is very important due to the fact that fault attacks have become a serious concern in cryptographic applications. The research will be based on adopting efficient concurrent error control coding approaches with low overhead and acceptable error detection capability. This research will lead to more secure and reliable cryptosystems with lower cost and higher performance. It will also significantly contribute to training highly qualified personnel for academia and a large number of companies in the Canadian Information and Communications Technologies (ICT) sector.
University of Western Ontario - $25,000 Grant (2017-1… | Canada Spends