Repository logo

Infoscience

  • English
  • French
Log In
Logo EPFL, École polytechnique fédérale de Lausanne

Infoscience

  • English
  • French
Log In
  1. Home
  2. Academic and Research Output
  3. Conferences, Workshops, Symposiums, and Seminars
  4. Cryptanalysis of ForkAES
 
conference paper

Cryptanalysis of ForkAES

Banik, Subhadeep  
•
Bossert, Jannis
•
Jana, Amit
Show more
2019
Lecture Notes in Computer Science
Applied Cryptography and Network Security

Forkciphers are a new kind of primitive proposed recently by Andreeva et al. for efficient encryption and authentication of small messages. They fork the middle state of a cipher and encrypt it twice under two smaller independent permutations. Thus, forkciphers produce two output blocks in one primitive call. Andreeva et al. proposed ForkAES, a tweakable AES-based forkcipher that splits the state after five out of ten rounds. While their authenticated encrypted schemes were accompanied by proofs, the security discussion for ForkAES was not provided, and founded on existing results on the AES and KIASU-BC. Forkciphers provide a unique interface called reconstruction queries that use one ciphertext block as input and compute the respective other ciphertext block. Thus, they deserve a careful security analysis. This work fosters the understanding of the security of ForkAES with three contributions: (1) We observe that security in reconstruction queries differs strongly from the existing results on the AES. This allows to attack nine out of ten rounds with differential, impossible-differential and yoyo attacks. (2) We observe that some forkcipher modes may lack the interface of reconstruction queries, so that attackers must use encryption queries. We show that nine rounds can still be attacked with rectangle and impossible-differential attacks. (3) We present forgery attacks on the AE modes proposed by Andreeva et al. with nine-round ForkAES.

  • Details
  • Metrics
Type
conference paper
DOI
10.1007/978-3-030-21568-2_3
Author(s)
Banik, Subhadeep  
Bossert, Jannis
Jana, Amit
List, Eik
Lucks, Stefan
Meier, Willi
Rahman, Mostafizar
Saha, Dhiman
Sasaki, Yu
Date Issued

2019

Published in
Lecture Notes in Computer Science
Volume

11464

Start page

43

End page

63

Editorial or Peer reviewed

REVIEWED

Written at

EPFL

EPFL units
LASEC  
Event name
Applied Cryptography and Network Security
Available on Infoscience
July 17, 2019
Use this identifier to reference this record
https://infoscience.epfl.ch/handle/20.500.14299/159198
Logo EPFL, École polytechnique fédérale de Lausanne
  • Contact
  • infoscience@epfl.ch

  • Follow us on Facebook
  • Follow us on Instagram
  • Follow us on LinkedIn
  • Follow us on X
  • Follow us on Youtube
AccessibilityLegal noticePrivacy policyCookie settingsEnd User AgreementGet helpFeedback

Infoscience is a service managed and provided by the Library and IT Services of EPFL. © EPFL, tous droits réservés