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

Department

Applied Statistics Unit (ASU-Kolkata)

Supervisor

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 .. . .

Comments

ProQuest Collection ID: http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&res_dat=xri:pqm&rft_dat=xri:pqdiss:28843429

Control Number

ISI-DISS-2018-400

Creative Commons License

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

DOI

http://dspace.isical.ac.in:8080/jspui/handle/10263/6966

This document is currently not available here.

Share

COinS