Cryptology ePrint Archive: Report 2017/849

FAST: Disk Encryption and Beyond

Debrup Chakraborty and Sebati Ghosh and Cuauhtemoc Mancillas Lopez and Palash Sarkar

Abstract: This work introduces FAST which is a new family of cryptographic primitives. Several instantiations of FAST are described. These are targeted towards two goals, the specific task of disk encryption and a more general scheme suitable for a wide variety of practical applications. Some of these applications are novel real-life use cases which are not covered by previously known cryptographic constructions. Detailed and careful implementations of several instantiations of FAST have been carried out in both software and hardware. For disk encryption, the results from the implementations show that FAST compares very favourably to the IEEE disk encryption standards XCB and EME2. Formally, FAST is a new family of tweakable enciphering schemes. It is built using a fixed input length pseudo-random function and an appropriate hash function. FAST uses a single-block key, is parallelisable and can be instantiated using only the encryption function of a block cipher. The hash function can be instantiated using either the Horner's rule based usual polynomial hashing or hashing based on the more efficient Bernstein-Rabin-Winograd polynomials. Security of FAST has been rigorously analysed using the standard provable security approach and concrete security bounds have been derived.

Category / Keywords: secret-key cryptography / tweakable enciphering schemes, pseudo-random function, Horner, BRW

Date: received 2 Sep 2017, last revised 9 Feb 2018

Contact author: palash at isical ac in

Available format(s): PDF | BibTeX Citation

Note: The material has been reorganised and portions of the proof has been rewritten.

Version: 20180209:093543 (All versions of this report)

Short URL:

Discussion forum: Show discussion | Start new discussion

[ Cryptology ePrint archive ]