Classification of the CAESAR Candidates Farzaneh Abed Christian - - PowerPoint PPT Presentation

classification of the caesar candidates
SMART_READER_LITE
LIVE PREVIEW

Classification of the CAESAR Candidates Farzaneh Abed Christian - - PowerPoint PPT Presentation

Introduction Design Approaches Functional Features Masking Methods Security Conclusion Classification of the CAESAR Candidates Farzaneh Abed Christian Forler Stefan Luck Bauhaus-Universit at Weimar ESC 2015, Luxembourg Jan, 2015


slide-1
SLIDE 1

Introduction Design Approaches Functional Features Masking Methods Security Conclusion

Classification of the CAESAR Candidates

Farzaneh Abed Christian Forler Stefan Luck

Bauhaus-Universit¨ at Weimar ESC 2015, Luxembourg

Jan, 2015

Farzaneh Abed, Christian Forler, Stefan Luck Classification of the CAESAR Candidates

slide-2
SLIDE 2

Introduction Design Approaches Functional Features Masking Methods Security Conclusion

Outline

1 Introduction 2 Design Approaches 3 Functional Features 4 Masking Methods 5 Security 6 Conclusion

Farzaneh Abed, Christian Forler, Stefan Luck Classification of the CAESAR Candidates

slide-3
SLIDE 3

Introduction Design Approaches Functional Features Masking Methods Security Conclusion

CAESAR

What is CAESAR? Competition for Authenticated Encryption: Security, Applicability, and Robustness Goal?

Farzaneh Abed, Christian Forler, Stefan Luck Classification of the CAESAR Candidates

slide-4
SLIDE 4

Introduction Design Approaches Functional Features Masking Methods Security Conclusion

CAESAR

What is CAESAR? Competition for Authenticated Encryption: Security, Applicability, and Robustness Goal? New authenticated encryption schemes which:

Farzaneh Abed, Christian Forler, Stefan Luck Classification of the CAESAR Candidates

slide-5
SLIDE 5

Introduction Design Approaches Functional Features Masking Methods Security Conclusion

CAESAR

What is CAESAR? Competition for Authenticated Encryption: Security, Applicability, and Robustness Goal? New authenticated encryption schemes which: Offer advantages over AES-GCM

Farzaneh Abed, Christian Forler, Stefan Luck Classification of the CAESAR Candidates

slide-6
SLIDE 6

Introduction Design Approaches Functional Features Masking Methods Security Conclusion

CAESAR

What is CAESAR? Competition for Authenticated Encryption: Security, Applicability, and Robustness Goal? New authenticated encryption schemes which: Offer advantages over AES-GCM Suitable for widespread adoption

Farzaneh Abed, Christian Forler, Stefan Luck Classification of the CAESAR Candidates

slide-7
SLIDE 7

Introduction Design Approaches Functional Features Masking Methods Security Conclusion

Time Schedule

Announced at ESC 2013 Co-funded by US NIST?!

Farzaneh Abed, Christian Forler, Stefan Luck Classification of the CAESAR Candidates

slide-8
SLIDE 8

Introduction Design Approaches Functional Features Masking Methods Security Conclusion

Time Schedule

Announced at ESC 2013 Co-funded by US NIST?! First round submission: March 2014 Reference software implementation: May 2014

Farzaneh Abed, Christian Forler, Stefan Luck Classification of the CAESAR Candidates

slide-9
SLIDE 9

Introduction Design Approaches Functional Features Masking Methods Security Conclusion

Time Schedule

Announcement of second round candidates: Jan 2015 Second round tweak, software and hardware implementation: Feb, March, April 2015

Farzaneh Abed, Christian Forler, Stefan Luck Classification of the CAESAR Candidates

slide-10
SLIDE 10

Introduction Design Approaches Functional Features Masking Methods Security Conclusion

Time Schedule

Announcement of second round candidates: Jan 2015 Second round tweak, software and hardware implementation: Feb, March, April 2015 Announcement of third round candidates: Dec 2015 Third round tweak, software and hardware implementation: Jan, Feb, March 2016

Farzaneh Abed, Christian Forler, Stefan Luck Classification of the CAESAR Candidates

slide-11
SLIDE 11

Introduction Design Approaches Functional Features Masking Methods Security Conclusion

Time Schedule

Announcement of second round candidates: Jan 2015 Second round tweak, software and hardware implementation: Feb, March, April 2015 Announcement of third round candidates: Dec 2015 Third round tweak, software and hardware implementation: Jan, Feb, March 2016 Announcement of finalist: Dec 2016 Final tweak, software and hardware implementation: Jan, Feb, March 2017

Farzaneh Abed, Christian Forler, Stefan Luck Classification of the CAESAR Candidates

slide-12
SLIDE 12

Introduction Design Approaches Functional Features Masking Methods Security Conclusion

Time Schedule

Announcement of second round candidates: Jan 2015 Second round tweak, software and hardware implementation: Feb, March, April 2015 Announcement of third round candidates: Dec 2015 Third round tweak, software and hardware implementation: Jan, Feb, March 2016 Announcement of finalist: Dec 2016 Final tweak, software and hardware implementation: Jan, Feb, March 2017 Announcement of final portfolio: Dec 2017

Farzaneh Abed, Christian Forler, Stefan Luck Classification of the CAESAR Candidates

slide-13
SLIDE 13

Introduction Design Approaches Functional Features Masking Methods Security Conclusion

Classification

Candidates 57 candidates for the first round! 8 candidates are broken

Farzaneh Abed, Christian Forler, Stefan Luck Classification of the CAESAR Candidates

slide-14
SLIDE 14

Introduction Design Approaches Functional Features Masking Methods Security Conclusion

Classification

Candidates 57 candidates for the first round! 8 candidates are broken What to compare:

Design approach Functional features Security

Farzaneh Abed, Christian Forler, Stefan Luck Classification of the CAESAR Candidates

slide-15
SLIDE 15

Introduction Design Approaches Functional Features Masking Methods Security Conclusion

Design Approach

Block Cipher Keyed family of permutation to encrypt message under a secret key. Full AES Round reduced AES New block cipher: KIASU, Deoxys, Joltik

Farzaneh Abed, Christian Forler, Stefan Luck Classification of the CAESAR Candidates

slide-16
SLIDE 16

Introduction Design Approaches Functional Features Masking Methods Security Conclusion

Design Approach

Block Cipher Keyed family of permutation to encrypt message under a secret key. Full AES Round reduced AES New block cipher: KIASU, Deoxys, Joltik Design #Candidates #Attacked AES Blockcipher-based 17 7 Round reduced/Modified AES 2 New block cipher 5 2

Farzaneh Abed, Christian Forler, Stefan Luck Classification of the CAESAR Candidates

slide-17
SLIDE 17

Introduction Design Approaches Functional Features Masking Methods Security Conclusion

Candidates

AES-based

COPA,CFPB,CLOC,ELmD,iFeed, OCB,SILC,SHELL,YAES ++AE,CMCC,AVALANCHE JAMBU,CBA,POET,Julius R-reduced-AES AEZ,Silver New BC Deoxys,Joltik,KIASU,SCREAM,L-Block

Farzaneh Abed, Christian Forler, Stefan Luck Classification of the CAESAR Candidates

slide-18
SLIDE 18

Introduction Design Approaches Functional Features Masking Methods Security Conclusion

Design Approach

Stream Cipher Symmetric pseudo-random bit generator: takes fixed key and generates keystream of variable length.

Farzaneh Abed, Christian Forler, Stefan Luck Classification of the CAESAR Candidates

slide-19
SLIDE 19

Introduction Design Approaches Functional Features Masking Methods Security Conclusion

Design Approach

Stream Cipher Symmetric pseudo-random bit generator: takes fixed key and generates keystream of variable length. Number of candidates: 8 Number of attacked candidates: 5

Farzaneh Abed, Christian Forler, Stefan Luck Classification of the CAESAR Candidates

slide-20
SLIDE 20

Introduction Design Approaches Functional Features Masking Methods Security Conclusion

Design Approach

Stream Cipher Symmetric pseudo-random bit generator: takes fixed key and generates keystream of variable length. Number of candidates: 8 Number of attacked candidates: 5 Candidates: Enchilada,HS1-SIV,Raviyoyla Acorn,Sablier,Calico,Trivia-ck,Wheesht

Farzaneh Abed, Christian Forler, Stefan Luck Classification of the CAESAR Candidates

slide-21
SLIDE 21

Introduction Design Approaches Functional Features Masking Methods Security Conclusion

Design Approach

Permutation Bijective mapping on fixed-length string. Number of candidates: 3 Number of attacked candidates: 1

Farzaneh Abed, Christian Forler, Stefan Luck Classification of the CAESAR Candidates

slide-22
SLIDE 22

Introduction Design Approaches Functional Features Masking Methods Security Conclusion

Design Approach

Permutation Bijective mapping on fixed-length string. Number of candidates: 3 Number of attacked candidates: 1 Candidates: Minalpher,PAEQ,Prøst

Farzaneh Abed, Christian Forler, Stefan Luck Classification of the CAESAR Candidates

slide-23
SLIDE 23

Introduction Design Approaches Functional Features Masking Methods Security Conclusion

Design Approach

Sponge Iterated function with variable length input/output from a permutation which operates on fixed length state.

Farzaneh Abed, Christian Forler, Stefan Luck Classification of the CAESAR Candidates

slide-24
SLIDE 24

Introduction Design Approaches Functional Features Masking Methods Security Conclusion

Design Approach

Sponge Iterated function with variable length input/output from a permutation which operates on fixed length state. Number of candidates: 9 Number of attacked candidates: 3

Farzaneh Abed, Christian Forler, Stefan Luck Classification of the CAESAR Candidates

slide-25
SLIDE 25

Introduction Design Approaches Functional Features Masking Methods Security Conclusion

Design Approach

Sponge Iterated function with variable length input/output from a permutation which operates on fixed length state. Number of candidates: 9 Number of attacked candidates: 3 Candidates: Artemia,Ascon,Ketje,Keyak,NORX,STRIBOB PRIMATE,ICEPOLE,π-Cipher

Farzaneh Abed, Christian Forler, Stefan Luck Classification of the CAESAR Candidates

slide-26
SLIDE 26

Introduction Design Approaches Functional Features Masking Methods Security Conclusion

Design Approach

Compression function Compresses two fixed-length inputs to a single fixed-length output. Number of candidates: 1 Number of attacked candidates:

Farzaneh Abed, Christian Forler, Stefan Luck Classification of the CAESAR Candidates

slide-27
SLIDE 27

Introduction Design Approaches Functional Features Masking Methods Security Conclusion

Design Approach

Compression function Compresses two fixed-length inputs to a single fixed-length output. Number of candidates: 1 Number of attacked candidates: Candidates: OMD

Farzaneh Abed, Christian Forler, Stefan Luck Classification of the CAESAR Candidates

slide-28
SLIDE 28

Introduction Design Approaches Functional Features Masking Methods Security Conclusion

Design Approach

Dedicated Message is used to update the state of the cipher and message authentication can be achieved for free. Number of candidates: 3 Number of attacked candidates:

Farzaneh Abed, Christian Forler, Stefan Luck Classification of the CAESAR Candidates

slide-29
SLIDE 29

Introduction Design Approaches Functional Features Masking Methods Security Conclusion

Design Approach

Dedicated Message is used to update the state of the cipher and message authentication can be achieved for free. Number of candidates: 3 Number of attacked candidates: Candidates: AEGIS,MORUS,Tiaoxin

Farzaneh Abed, Christian Forler, Stefan Luck Classification of the CAESAR Candidates

slide-30
SLIDE 30

Introduction Design Approaches Functional Features Masking Methods Security Conclusion

Overview

Attribute #Candidates/56 1 #Attacked Block Cipher 30 14 (46.66%) Sponge 10 4 (40%) Stream Cipher 9 6 (66.66%) Permutation 3 1 (33.33%) Dedicated 3 Compression Function 1

1We don’t consider POLAWIS because of its complicated structure. Farzaneh Abed, Christian Forler, Stefan Luck Classification of the CAESAR Candidates

slide-31
SLIDE 31

Introduction Design Approaches Functional Features Masking Methods Security Conclusion

Functional Feature

Parallelizeable Processing of i-th input block does not depend on the output of processing the j-th block. Number of candidates: Encryption/Decryption 3/2 Number of candidates: Both Enc & Dec 30 Number of attacked candidates: 12

Farzaneh Abed, Christian Forler, Stefan Luck Classification of the CAESAR Candidates

slide-32
SLIDE 32

Introduction Design Approaches Functional Features Masking Methods Security Conclusion

Functional Feature

Parallelizeable Processing of i-th input block does not depend on the output of processing the j-th block. Number of candidates: Encryption/Decryption 3/2 Number of candidates: Both Enc & Dec 30 Number of attacked candidates: 12

Farzaneh Abed, Christian Forler, Stefan Luck Classification of the CAESAR Candidates

slide-33
SLIDE 33

Introduction Design Approaches Functional Features Masking Methods Security Conclusion

Candidates

Only Encryption AES-CPFB,iFeed,AEGIS Only Decryption AES-CMCC,SILC Both Enc/DEC

AES-COPA,AES-OTR,AEZ,Deoxy,ELmD,Enchilada

Joltik,Keyak,KIASU,Minalpher,NORX,OCB PAEQ,SHELL,Silver,Tiaoxin,YAES ++AE,Acorn,AVALANCHE,CBA ICEPOLE,Julius,LAC,π-cipher Prøst,Sablier,SCREAM,Trivia-ck

Farzaneh Abed, Christian Forler, Stefan Luck Classification of the CAESAR Candidates

slide-34
SLIDE 34

Introduction Design Approaches Functional Features Masking Methods Security Conclusion

Functional Feature

Online Encryption of the i-th input block Mi depends only on the M1, · · · , Mi−1 blocks. Number of candidates: 44 Number of attacked candidates: 15

Farzaneh Abed, Christian Forler, Stefan Luck Classification of the CAESAR Candidates

slide-35
SLIDE 35

Introduction Design Approaches Functional Features Masking Methods Security Conclusion

Candidates

Not Online AEZ,HS1-SIV AES-CMCC,Julius,Trivia-ck Attacked online candidates

++AE,AES-JAMBU,AVALANCHE

Calico,CBA,Julius,LAC,POET Acorn,Sablier,Wheesht,ICEPOLE PRIMATE,π-cipher,Prøst

Farzaneh Abed, Christian Forler, Stefan Luck Classification of the CAESAR Candidates

slide-36
SLIDE 36

Introduction Design Approaches Functional Features Masking Methods Security Conclusion

Functional Feature

Inverse-Free Scheme requires only decryption or encryption function of underlying primitive. Number of candidates: 37 Number of attacked candidates: 15

Farzaneh Abed, Christian Forler, Stefan Luck Classification of the CAESAR Candidates

slide-37
SLIDE 37

Introduction Design Approaches Functional Features Masking Methods Security Conclusion

Candidates

Candidates

COPA,CPFB,AEZ,OTR,CLOC,iFeed,SILC,YAES,AEGIS

MORUS,Tiaoxin,Enchilada,HS1-SIV,Raviyoyla,OMD PAEQ,Artemia,Ascon,Ketje,Keyak,NORX,STRIBOB Calico,JAMBU,AVALANCHE,CBA Julius,POET,Acorn,SCREAM,Sablier Trivia-ck,Wheesht,ICEPOLE,PRIMATE π-cipher,Prøst

Farzaneh Abed, Christian Forler, Stefan Luck Classification of the CAESAR Candidates

slide-38
SLIDE 38

Introduction Design Approaches Functional Features Masking Methods Security Conclusion

Functional Feature

Incremental Associated Data/AE Given a previous authenticated (C,T) for message M, encrypting and authenticating message M

′ which differ from M with fraction,

is computed only for changed block. Means, only the changed blocks and a finalization step need re-computation. Number of candidates: AD/AE 11/0 Number of candidates: AD&AE 1 Number of attacked candidates: 4

Farzaneh Abed, Christian Forler, Stefan Luck Classification of the CAESAR Candidates

slide-39
SLIDE 39

Introduction Design Approaches Functional Features Masking Methods Security Conclusion

Candidates

Only Associated Data AES-COPA,AES-OTR,AEZ Enchilada,iFeed,OMD,YAES CBA,POET,Sablier,Prøst Both AD/AE PAEQ

Farzaneh Abed, Christian Forler, Stefan Luck Classification of the CAESAR Candidates

slide-40
SLIDE 40

Introduction Design Approaches Functional Features Masking Methods Security Conclusion

Functional Feature

Fixed-Associated Data Reuse Using the same or slightly modified associated data for subsequent messages. Number of candidates: 14 Number of attacked candidates: 5

Farzaneh Abed, Christian Forler, Stefan Luck Classification of the CAESAR Candidates

slide-41
SLIDE 41

Introduction Design Approaches Functional Features Masking Methods Security Conclusion

Functional Feature

Fixed-Associated Data Reuse Using the same or slightly modified associated data for subsequent messages. Number of candidates: 14 Number of attacked candidates: 5 Candidates:

Farzaneh Abed, Christian Forler, Stefan Luck Classification of the CAESAR Candidates

slide-42
SLIDE 42

Introduction Design Approaches Functional Features Masking Methods Security Conclusion

Functional Feature

Fixed-Associated Data Reuse Using the same or slightly modified associated data for subsequent messages. Number of candidates: 14 Number of attacked candidates: 5 Candidates:

AES-COPA,AES-OTR,AEZ,CLOC,Enchilada,iFeed,OMD,PAEQ,YAES

Farzaneh Abed, Christian Forler, Stefan Luck Classification of the CAESAR Candidates

slide-43
SLIDE 43

Introduction Design Approaches Functional Features Masking Methods Security Conclusion

Functional Feature

Fixed-Associated Data Reuse Using the same or slightly modified associated data for subsequent messages. Number of candidates: 14 Number of attacked candidates: 5 Candidates:

AES-COPA,AES-OTR,AEZ,CLOC,Enchilada,iFeed,OMD,PAEQ,YAES

CBA,POET,PRIMATE,Prøst,Sablier

Farzaneh Abed, Christian Forler, Stefan Luck Classification of the CAESAR Candidates

slide-44
SLIDE 44

Introduction Design Approaches Functional Features Masking Methods Security Conclusion

Functional Feature

Intermediate Tags Receiver detects early if parts of decrypted message are invalid. Number of candidates: 7 Number of attacked candidates: 3

Farzaneh Abed, Christian Forler, Stefan Luck Classification of the CAESAR Candidates

slide-45
SLIDE 45

Introduction Design Approaches Functional Features Masking Methods Security Conclusion

Functional Feature

Intermediate Tags Receiver detects early if parts of decrypted message are invalid. Number of candidates: 7 Number of attacked candidates: 3 Candidates:

Farzaneh Abed, Christian Forler, Stefan Luck Classification of the CAESAR Candidates

slide-46
SLIDE 46

Introduction Design Approaches Functional Features Masking Methods Security Conclusion

Functional Feature

Intermediate Tags Receiver detects early if parts of decrypted message are invalid. Number of candidates: 7 Number of attacked candidates: 3 Candidates:

Ketje,Keyak,ELmD,iFeed,Trivia-ck,ICEPOLE,POET

Farzaneh Abed, Christian Forler, Stefan Luck Classification of the CAESAR Candidates

slide-47
SLIDE 47

Introduction Design Approaches Functional Features Masking Methods Security Conclusion

Overview

Feature #Candidates #Attacked Parallelizeable 30 12 Online 44 15 Inverse-Free 37 15 Incremental AD/AE 11 4 Fixed AD reuse 14 5 Intermediate tag 7 3

Farzaneh Abed, Christian Forler, Stefan Luck Classification of the CAESAR Candidates

slide-48
SLIDE 48

Introduction Design Approaches Functional Features Masking Methods Security Conclusion

Input Masking Methods

AX: Addition and XOR Doubling: XOR with a key dependent variable doubled in Galois Field GFM: Multiplication in Galois Field AES: XORing AES-processed chaining value

Farzaneh Abed, Christian Forler, Stefan Luck Classification of the CAESAR Candidates

slide-49
SLIDE 49

Introduction Design Approaches Functional Features Masking Methods Security Conclusion

Input Masking Methods

AX: Addition and XOR Doubling: XOR with a key dependent variable doubled in Galois Field GFM: Multiplication in Galois Field AES: XORing AES-processed chaining value

Method #Candidates Candidates AX 1 ++AE Doubling 7 AES-COPA,AES-OTR,CBA ELmD,iFeed,OCB,SHELL GFM 1 Julius AES 1 POET

Farzaneh Abed, Christian Forler, Stefan Luck Classification of the CAESAR Candidates

slide-50
SLIDE 50

Introduction Design Approaches Functional Features Masking Methods Security Conclusion

Security

Privacy IND-CPA-Security

Farzaneh Abed, Christian Forler, Stefan Luck Classification of the CAESAR Candidates

slide-51
SLIDE 51

Introduction Design Approaches Functional Features Masking Methods Security Conclusion

Security

Privacy IND-CPA-Security Integrity INT-CTXT-Security

Farzaneh Abed, Christian Forler, Stefan Luck Classification of the CAESAR Candidates

slide-52
SLIDE 52

Introduction Design Approaches Functional Features Masking Methods Security Conclusion

Provably Secure Candidates

Number of candidates: 33 Number of attacked candidates: 8

Farzaneh Abed, Christian Forler, Stefan Luck Classification of the CAESAR Candidates

slide-53
SLIDE 53

Introduction Design Approaches Functional Features Masking Methods Security Conclusion

Provably Secure Candidates

Number of candidates: 33 Number of attacked candidates: 8 Candidates

AES-COPA,AES-CPFB,AES-OTR,AEZ

Artemia,Ascon,CLOC,Deoxy,ELmD iFeed,Joltik,KIASU,OCB,SILC,SHELL Silver,Enchilada,HS1-SIV,OMD,Minalpher PAEQ,Ketje,Keyak,NORX,STRIBOB AES-CMCC,AVALANCHE,ICEPOLE,Julius POET,Trivia-ck,PRIMATE,Prøst

Farzaneh Abed, Christian Forler, Stefan Luck Classification of the CAESAR Candidates

slide-54
SLIDE 54

Introduction Design Approaches Functional Features Masking Methods Security Conclusion

Security

Robustness Nonce-misuse:

Offline scheme: PRP-CPA and INT-CTXT Online scheme: OPRP-CPA and INT-CTXT

Farzaneh Abed, Christian Forler, Stefan Luck Classification of the CAESAR Candidates

slide-55
SLIDE 55

Introduction Design Approaches Functional Features Masking Methods Security Conclusion

Security

Robustness Nonce-misuse:

Offline scheme: PRP-CPA and INT-CTXT Online scheme: OPRP-CPA and INT-CTXT

Decryption-misuse:

Offline scheme: PRP-CCA Online scheme: OPRP-CCA

Farzaneh Abed, Christian Forler, Stefan Luck Classification of the CAESAR Candidates

slide-56
SLIDE 56

Introduction Design Approaches Functional Features Masking Methods Security Conclusion

Security

Robustness Nonce-misuse:

Offline scheme: PRP-CPA and INT-CTXT Online scheme: OPRP-CPA and INT-CTXT

Decryption-misuse:

Offline scheme: PRP-CCA Online scheme: OPRP-CCA

Robustness #Candidates #Attacked Candidates NMR 21 8 DMR 5 3

Farzaneh Abed, Christian Forler, Stefan Luck Classification of the CAESAR Candidates

slide-57
SLIDE 57

Introduction Design Approaches Functional Features Masking Methods Security Conclusion

Candidates

NMR AES-COPA,AEZ,Deoxy,ELmD,iFeed Joltik,KIASU,SHELL,HS1-SIV Minalpher,PAEQ,Artemia,Ascon ++AE,AES-CMCC,AES-JAMBU ICEPOLE,Julius,POET,PRIMATE,Prøst DMR AEZ,Minalpher POET,PRIMATE,Prøst

Farzaneh Abed, Christian Forler, Stefan Luck Classification of the CAESAR Candidates

slide-58
SLIDE 58

Introduction Design Approaches Functional Features Masking Methods Security Conclusion

Overview

Statistic Candidates #Unharmed #Harmed Conceded Broken 57 32 (56.14%) 18 (29.82%) 8 (14.03%)

Farzaneh Abed, Christian Forler, Stefan Luck Classification of the CAESAR Candidates

slide-59
SLIDE 59

Introduction Design Approaches Functional Features Masking Methods Security Conclusion

Overview

Statistic Candidates #Unharmed #Harmed Conceded Broken 57 32 (56.14%) 18 (29.82%) 8 (14.03%) Broken Candidates COBRA,CBEAM,FASER,HKC,McMambo,PAES,PANDA,Marble

Farzaneh Abed, Christian Forler, Stefan Luck Classification of the CAESAR Candidates

slide-60
SLIDE 60

Introduction Design Approaches Functional Features Masking Methods Security Conclusion

Attacks Forgery Distinguish Key/State Recovery Other 19 5 11 3

Farzaneh Abed, Christian Forler, Stefan Luck Classification of the CAESAR Candidates

slide-61
SLIDE 61

Introduction Design Approaches Functional Features Masking Methods Security Conclusion

Candidates

Forgery

++AE,Calico,COBRA,JAMBU,Julius-ECB LAC,AVALANCHE,CMCC,HKC,Marble McMambo,Scream,Wheesht,POET,PAES PANDA,CBEAM,π-cipher,Prøst-OTR Key/State Recovery PRIMATE,ICEPOLE,Sablier,Wheesht Trivia-ck,Acorn,PANDA,FASER,Calico Marble,Prøst-OTR Distinguish CBA,CMCC,FASER,ICEPOLE,Wheesht Other Pi-Cipher,PRIMATE,POET

Farzaneh Abed, Christian Forler, Stefan Luck Classification of the CAESAR Candidates

slide-62
SLIDE 62

Introduction Design Approaches Functional Features Masking Methods Security Conclusion

The End.

Thank you for your attention!

Farzaneh Abed, Christian Forler, Stefan Luck Classification of the CAESAR Candidates