loading
Papers

Research.Publish.Connect.

Paper

Paper Unlock

Authors: Florian Legendre 1 ; Gilles Dequen 2 and Michaël Krajecki 1

Affiliations: 1 University of Reims Champagne-Ardennes, France ; 2 University of Picardie Jules Verne, France

ISBN: 978-989-8565-24-2

Keyword(s): Logic, Cryptanalysis, Hash Function, MD5, Satisfiability.

Related Ontology Subjects/Areas/Topics: Applied Cryptography ; Cryptographic Techniques and Key Management ; Data Engineering ; Databases and Data Security ; Information and Systems Security

Abstract: The SATisfiability Problem is a core problem in mathematical logic and computing theory. The last decade progresses have led it to be a great and competitive approach to practically solve a wide range of industrial and academic problems. Thus, the current SAT solving capacity allows the propositional formalism to be an interesting alternative to tackle cryptanalysis problems. This paper deals with an original application of the SAT problem to cryptanalysis. We thus present a principle, based on a propositional modeling and solving, and provide details on logical inferences, simplifications, learning and pruning techniques used as a preprocessor with the aim of reducing the computational complexity of the SAT solving and hence weakening the associated cryptanalysis. As cryptographic hash functions are central elements in modern cryptography we choose to illustrate our approach with a dedicated attack on the second preimage of the well-known MD⋆ hash functions. We finally validate this reverse-engineering process, thanks to a generic SAT solver achieving a weakening of the inversion of MD⋆. As a result, we present an improvement of the current limit of best practical attacks on step-reduced MD4 and MD5 second preimage, respectively up to 39 and 28 inverted rounds. (More)

PDF ImageFull Text

Download
CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 18.208.187.169

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Legendre, F.; Dequen, G. and Krajecki, M. (2012). Inverting Thanks to SAT Solving - An Application on Reduced-step MD*.In Proceedings of the International Conference on Security and Cryptography - Volume 1: SECRYPT, (ICETE 2012) ISBN 978-989-8565-24-2, pages 339-344. DOI: 10.5220/0004077603390344

@conference{secrypt12,
author={Florian Legendre. and Gilles Dequen. and Michaël Krajecki.},
title={Inverting Thanks to SAT Solving - An Application on Reduced-step MD*},
booktitle={Proceedings of the International Conference on Security and Cryptography - Volume 1: SECRYPT, (ICETE 2012)},
year={2012},
pages={339-344},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0004077603390344},
isbn={978-989-8565-24-2},
}

TY - CONF

JO - Proceedings of the International Conference on Security and Cryptography - Volume 1: SECRYPT, (ICETE 2012)
TI - Inverting Thanks to SAT Solving - An Application on Reduced-step MD*
SN - 978-989-8565-24-2
AU - Legendre, F.
AU - Dequen, G.
AU - Krajecki, M.
PY - 2012
SP - 339
EP - 344
DO - 10.5220/0004077603390344

Login or register to post comments.

Comments on this Paper: Be the first to review this paper.