An Distinguishing Attack on LDT.

Date of Submission

December 2018

Date of Award

Winter 12-12-2019

Institute Name (Publisher)

Indian Statistical Institute

Document Type

Master's Dissertation

Degree Name

Master of Technology

Subject Name

Computer Science


Applied Statistics Unit (ASU-Kolkata)


Nandi, Mridul (ASU-Kolkata; ISI)

Abstract (Summary of the Work)

Length doublers are cryptographic functions that transform an n bit tweakable block cipher into an efficient and secure cipher that length-preservingly encrypts any string of length in [n,...,(2n-1)] . One of them, LDT by Chen et al.(ToSC 2017 ) is secure up to 2n/2 queries . Let m ∈ [kn,(n-1)] for some constant k < 1 .They described a possibility of attack against LDT in approximately 2n−(m/2) queries of size n + m based on distinguishing a truncated permutation from random function . We here describe attack for k = 2/3 .. . .


ProQuest Collection ID:

Control Number


Creative Commons License

Creative Commons Attribution 4.0 International License
This work is licensed under a Creative Commons Attribution 4.0 International License.


This document is currently not available here.