Grant: Discovery Grants Program - Individual
Concordia University
$30,000.00
Analysis and Design of Authenticated Encryption Schemes
FY 2015-16
Summary
While in most people's minds confidentiality is the primary goal of cryptography, message authentication is arguably as important. Cryptographers have long realized the importance of the privacy and integrity goals. However, the traditional approach to tackle the problem of achieving confidentiality and integrity has been to consider these two goals in isolation; security researchers designed encryption schemes to protect the privacy of digital communication and they independently designed message authentication codes to protect its integrity. Recently, there have been a series of disastrous attacks resulting from the wrong application of confidentiality and authenticity primitives. Consequently, and following the National Institute for Standards and Technology (NIST) Advanced Encryption Standard (AES) competition, the European Union eStream competition, and the NIST SHA-3 hash function competition, a new Competition for Authenticated Encryption: Security, Applicability, and Robustness (CAESAR) funded by NIST was announced. While being relatively new, this competition has provided a boost to the cryptographic research community to consider the analysis and design of authenticated encryption (AE) primitives. In the first phase of this competition, which started in March 2014, 57 submissions were received. Since this competition has been opened, AE schemes are probably the most frequently visited and challenging topic in the area of symmetric key cryptology.
There are mainly two approaches to design an integrated AE algorithm. The first is to use a block cipher in a special mode. The second, and arguably more efficient approach, is to design a dedicated AE algorithm where the message is used to update the state of the underlying cipher and message authentication can be achieved almost for free. In this research project, we plan to focus on schemes constructed using the latter approach.
The objective of this project is to investigate the design, analysis and implementation of efficient families of provably secure (against a predefined set of cryptanalytic attacks) dedicated AE schemes. In particular, we plan to (i) Apply state of the art cryptanalytic attacks and automated cryptanalysis tools to the AE schemes submitted to the CAESAR competition, (ii) Investigate different construction methods for AE schemes including new designs whose underlying primitives are based on AES-like primitives and the recently proposed cryptographic Duplex/Sponge-based constructions (the recently selected hash function standard is a Sponge-based construction) (iii) Establish a criteria for quantifying the AE scheme resistance against different attacks, including side channel attacks, and apply this knowledge to the design of an efficient, secure, nonce misuse resistant, parallelizable and online AE which can be optimized to operate within resource constrained environments.
Program
Discovery Grants Program - Individual
Recipient
Location
Quebec, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data
As published
Application id
RGPIN-2015-05913
Name nom
Youssef, Amr
Department département
Concordia Institute for Information Systems Engineering (CIISE) - Concordia Inst
Organization id
70
Institution établissement
Concordia University
Province en
Québec
Province fr
Québec
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2015
Competition year année de concours
2015
Award amount
30000
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
1207
Area of application group en
Advancement of knowledge
Area of application group fr
Avancement des connaissances
Area of application en
Information, computer and communication technologies
Area of application fr
Technologie de l'information, des ordinateurs et des réseaux de communications
Research subject code
2507
Research subject group en
Electrical and electronic engineering
Research subject group fr
Génie électrique et électronique
Research subject en
Communications systems
Research subject fr
Systèmes de télécommunications
Partie
1
Nb partie
5
Application title
Analysis and Design of Authenticated Encryption Schemes
Keyword
NSERC
Application summary
<p>While in most people's minds confidentiality is the primary goal of cryptography, message authentication is arguably as important. Cryptographers have long realized the importance of the privacy and integrity goals. However, the traditional approach to tackle the problem of achieving confidentiality and integrity has been to consider these two goals in isolation; security researchers designed encryption schemes to protect the privacy of digital communication and they independently designed message authentication codes to protect its integrity. Recently, there have been a series of disastrous attacks resulting from the wrong application of confidentiality and authenticity primitives. Consequently, and following the National Institute for Standards and Technology (NIST) Advanced Encryption Standard (AES) competition, the European Union eStream competition, and the NIST SHA-3 hash function competition, a new Competition for Authenticated Encryption: Security, Applicability, and Robustness (CAESAR) funded by NIST was announced. While being relatively new, this competition has provided a boost to the cryptographic research community to consider the analysis and design of authenticated encryption (AE) primitives. In the first phase of this competition, which started in March 2014, 57 submissions were received. Since this competition has been opened, AE schemes are probably the most frequently visited and challenging topic in the area of symmetric key cryptology.<br />
<br />
There are mainly two approaches to design an integrated AE algorithm. The first is to use a block cipher in a special mode. The second, and arguably more efficient approach, is to design a dedicated AE algorithm where the message is used to update the state of the underlying cipher and message authentication can be achieved almost for free. In this research project, we plan to focus on schemes constructed using the latter approach. </p>
<p>The objective of this project is to investigate the design, analysis and implementation of efficient families of provably secure (against a predefined set of cryptanalytic attacks) dedicated AE schemes. In particular, we plan to (i) Apply state of the art cryptanalytic attacks and automated cryptanalysis tools to the AE schemes submitted to the CAESAR competition, (ii) Investigate different construction methods for AE schemes including new designs whose underlying primitives are based on AES-like primitives and the recently proposed cryptographic Duplex/Sponge-based constructions (the recently selected hash function standard is a Sponge-based construction) (iii) Establish a criteria for quantifying the AE scheme resistance against different attacks, including side channel attacks, and apply this knowledge to the design of an efficient, secure, nonce misuse resistant, parallelizable and online AE which can be optimized to operate within resource constrained environments.</p>