DOCSLIB.ORG

International Journal of Computer Engineering and Applications, Volume XII, Special Issue, May 18, ISSN 2321-3469

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
International Journal of Computer Engineering and Applications, Volume XII, Special Issue, May 18, ISSN 2321-3469 International Journal of Computer Engineering and Applications, Volume XII, Special Issue, May 18, www.ijcea.com ISSN 2321-3469 PROVIDING RESTRICTIONS AGAINST ATTACK AND CONGESTION CONTROL IN PUBLICINFRASTRUCTURE CLOUD Nousheen R1, Shanmugapriya M2, Sujatha P3,Dhinakaran D4 Student, Computer Science and Engineering, Peri Institute of Technology, Chennai, India 1,2,3 Assistant professor, Computer Science and Engineering, Peri Institute of Technology, Chennai, India 4 ABSTRACT: Cloud computing is current trend in market .It reduce the cost and complexity of service providers by the means of capital and operational cost.It allows users to access application remotely. This construct directs cloud service provider to handle cost of servers, software updates,etc. If the session tokens are not properly protected, an attacker can hijack an active session and assume the identity of a user. To focusing on session hijacking and broken authenticationOTP is generated it will send user mail.Once the user is authenticatedthey will be split into virtual machine it is initiate to the upload process into the cloud.Thecloud user files are uploaded and stored in domain based .Also in our proposed system encryption keys are maintained outside of the IaaS domain.For encryption, we proposed RSA algorithm .For data owner file encryption, we use camellia algorithm. Finally the files are stored in the public cloud named CloudMe. Keywords: Cloud computing, session hijacking, OTP, Virtual machine, Iaas, CloudMe [1] INTRODUCTION Cloud computing is an information technology(IT) standard that enables universal access to share group of configurable system resource and higher-level services that can be quickly provisioned with minimal management effort, often over the internet. Cloud providers Nousheen R, Shanmugapriya M, Sujatha P,Dhinakaran D 1 PROVIDING RESTRICTIONS AGAINST ATTACK AND CONGESTION CONTROL IN PUBLICINFRASTRUCTURE CLOUD typically use a “pay-as-you-go” model which can lead to unexpected operating expenses if administrators are not comfortable with cloud-pricing models. Companies can greatly reduce IT costs by off –loading data and computation to cloud computing services mostly, due to outstanding concerns. Closed platform can give creators complete control over the structure and difficulty of the software stack, thus they can alter it to their security requests. Maintenance of cloud computing applications is easier, because they do not need to be installed on each user’s computer and can be accessed from different places (e.g., different work locations, while travelling, etc.). Infrastructure as a service (IaaS) refers to online services that provide high -level APIs used to dereference various low –level details of underlying network infrastructure like physical computing resources, location, data partitioning, scaling, security, backup etc. IaaSclouds often offer additional resources such as virtual –machine disk –image library, raw block storage, file or object storage, firewall, load balancer, IP addresses virtual local area networks (VLANs), and software bundles. Cloud computing has improved an idea to enormous deployment in various application domains. The difficulty of cloud computing introduce innovative security risk and challenges. Session hijacking is used to gain unauthorized access to information or service in a computer system by managing the user name and password. This proposes, a session hijacking attacks detection mechanism by periodicallymonitoring the received signal strengthvalues for a particular MAC addresses. The advantage is that it makes difficult for an attacker to avoid detection by modifying its transmission power since, it is difficult for the attacker to predict the use’s data. The need for operational and cost –effective cloud platform security mechanism is suitable for organisations that depend on cloud infrastructure. For the security of data the files are encrypted and stored in virtual machine. A set of protocols for launch of virtual machines (VM) in IaaS, which provide user with a proof that the requested VM instances were impelled on a host with an expected software stack. The domain –based storage protection protocol is introduced to allow domain manager’s to store encrypted data.An attacks applicable toIaaS environment and use them to develop protocols with preferred security stuffs, implement the security analysis and prove their conflict besides the attacks. [2] EXISTING SYSTEM In the existing system, the result offers cloud occupiers a proof regarding the integrity of computer hosts understanding their portion of the cloud infrastructure. Also no secure framework in cloud environment to deliver security against cloud attacks. The user’s files and data are stored in the single virtual machine and this leads to the congestion during the file request and response. VM environment can select to encrypt data on the operating system (OS) level within their datacentres. This method suffers from several drawbacks: first, the computer host will have right to use encryption keys whenever the VM performs cryptographic operations; second, this shift near the tenant burden of sustaining the encryption software in all their VM instances and increases the attack surface; third, this involves injecting, migrating and later securely extracting encryption keys to each of the VM instances with right to use the encrypted data, increasing the possibility than an attacker finally obtains the keys. In most cases cloud providers continues and manage the keys needed for encryption of data at rest. Then the cloud convolutes the earlier complex data migration process between different cloud Nousheen R, Shanmugapriya M, Sujatha P,Dhinakaran D 2 International Journal of Computer Engineering and Applications, Volume XII, Special Issue, May 18, www.ijcea.com ISSN 2321-3469 providers, disadvantaging tenant through a new variant of vendor lock –in. Also in existing system outbreaks or threats to the infrastructure is not efficiently handled. DISADVANTAGE This approach suffers from several models: 1. The underlying computer host will still access the encryption keys whenever the VM approaches the cryptographic. 2. This shifts towards the tenant the burden of maintaining the encryption software in all their VM instances and increases the attack surfaces. [3] PROPOSED SYSTEM In proposed system, a framework for data and operation security in IaaS is described that consist of protocols for a trusted launch of virtual machines and domain –based storage protection. Thus once the user is authenticated they will be launched in virtual machines where they initiate the upload process into the cloud.The cloud user files are uploaded and stored in domain based. To provide resistance against cloud based web application attacks (focusing on session hijacking and broken authentication). Authentication is a critical aspect of this process, but even solid authentication mechanisms can be undermined by flawed credential management functions, including password change, forgot my password, remember my password, account update, and other related functions. In either case, if the session tokens are not properly protected, an attacker can hijack an active session and assume the identity of a user. Creating a scheme to create strong session tokens and protect them throughout their lifecycle has proven elusive for many developers. For session management, we have implemented cookie management and idle timeout. Also in our proposed system encryption keys are maintained outside of the IaaS domain. For key encryption we proposed RSA algorithm. For data owner file encryption, we use camellia algorithm. Finally the files are stored in public cloud named CloudMe [4]SAMPLE MODULE REGISTER &LOGIN Request key USER DOMAIN MANAGER Response key Session Hijacking (overcome)&Broken Authentication FILE FILE ENCRYPTION UPLOAD Key Generation using RSA CAMELLIA ALGORITHM ORIGINAL FILE DOMAIN SPECIFIC STORAGE Nousheen R, Shanmugapriya M, Sujatha P,Dhinakaran D 3 PROVIDING RESTRICTIONS AGAINST ATTACK AND CONGESTION CONTROL IN PUBLICINFRASTRUCTURE CLOUD VM1 VM2 DOWNLOAD UPLOAD CLOUD DECRYPTION The infrastructure cloud service model is used to store data securely using the privacy preserving .User will register using user details and Login into an account. User will Sign in with username and password. Two major attacks which is the SQL injection attack and session hijacking is explored in depth .In any case, if session tokens are not properly protected, an attacker can hijack the user identity .To overcome session hijacking,OTP is generated to user’s mail for security .If the OTP is success it enter into the user page otherwise its pushed out .Then user upload files and requests the domain manager .The user is authenticated the domain manager will response to the user .Once the user is authenticated they will be launched in virtual machines where they upload process into the cloud .The keys are encrypted using RSA algorithm. The domain manager accept the user file and it is upload in the user side. Domain manager will encrypt the file using camellia algorithm. Domain specific storage split the files into different virtual machine and upload the files in CloudMe. Once the user request for the file in the domain manager and download the files from cloud after decryption. [5] IDENTITY MANAGEMENT: Identity Management may come under the privacy preserving .This done in the user side. Initially while registering details in our system, we need to set the unique ID, during registration
Load more

Recommended publications
  • Improved Cryptanalysis of the Reduced Grøstl Compression Function, ECHO Permutation and AES Block Cipher
    Improved Cryptanalysis of the Reduced Grøstl Compression Function, ECHO Permutation and AES Block Cipher Florian Mendel1, Thomas Peyrin2, Christian Rechberger1, and Martin Schl¨affer1 1 IAIK, Graz University of Technology, Austria 2 Ingenico, France [email protected],[email protected] Abstract. In this paper, we propose two new ways to mount attacks on the SHA-3 candidates Grøstl, and ECHO, and apply these attacks also to the AES. Our results improve upon and extend the rebound attack. Using the new techniques, we are able to extend the number of rounds in which available degrees of freedom can be used. As a result, we present the first attack on 7 rounds for the Grøstl-256 output transformation3 and improve the semi-free-start collision attack on 6 rounds. Further, we present an improved known-key distinguisher for 7 rounds of the AES block cipher and the internal permutation used in ECHO. Keywords: hash function, block cipher, cryptanalysis, semi-free-start collision, known-key distinguisher 1 Introduction Recently, a new wave of hash function proposals appeared, following a call for submissions to the SHA-3 contest organized by NIST [26]. In order to analyze these proposals, the toolbox which is at the cryptanalysts' disposal needs to be extended. Meet-in-the-middle and differential attacks are commonly used. A recent extension of differential cryptanalysis to hash functions is the rebound attack [22] originally applied to reduced (7.5 rounds) Whirlpool (standardized since 2000 by ISO/IEC 10118-3:2004) and a reduced version (6 rounds) of the SHA-3 candidate Grøstl-256 [14], which both have 10 rounds in total.
    [Show full text]
  • Iso/Iec Jtc 1/Sc 27/Wg 2 N 1804
    ISO/IEC JTC 1/SC 27/WG 2 N 1804 ISO/IEC JTC 1/SC 27/WG 2 Cryptography and security mechanisms Convenorship: JISC (Japan) Document type: Officer's Contribution Title: A Memo on Kuznyechik S-Box Status: Date of document: 2018-09-27 Source: Project Editor (Vasily Shishkin), Project Co-editor (Grigory Marshalko) Expected action: ACT Action due date: 2018-10-04 No. of pages: 1 + 4 Email of convenor: [email protected] Committee URL: https://isotc.iso.org/livelink/livelink/open/jtc1sc27wg2 A Memo on Kuznyechik S-Box During ballot on 18033-3 DAmd1 (finished in June 2018) comments from some NB were received concerning issues regarding Kuznyechik design rationale and its parameters origins. The goal of this Memo is to provide all relevant information known to the designers of the algorithm. Kuznyechik has transparent and well studied design. Its design rationale was introduced to WG2 experts in 2016 by presentation (WG2) N1740. Kuznyechik is based on well examined constructions. Each transformation provides certain cryptographic properties. All transformations used as building blocks have transparent origin. The only transformation used in Kuznyechik which origin may be questioned is the S-box π. This S-box was chosen from Streebog hash-function and it was synthesized in 2007. Note that through many years of cryptanalysis no weakness of this S-box was found. The S-box π was obtained by pseudo- random search and the following properties were taken into account. 1. The differential characteristic π pπ = max pα,β; α,β2V8nf0g π where pα,β = Pfπ(x ⊕ α) ⊕ π(x) = βg.
    [Show full text]
  • State of the Art in Lightweight Symmetric Cryptography
    State of the Art in Lightweight Symmetric Cryptography Alex Biryukov1 and Léo Perrin2 1 SnT, CSC, University of Luxembourg, [email protected] 2 SnT, University of Luxembourg, [email protected] Abstract. Lightweight cryptography has been one of the “hot topics” in symmetric cryptography in the recent years. A huge number of lightweight algorithms have been published, standardized and/or used in commercial products. In this paper, we discuss the different implementation constraints that a “lightweight” algorithm is usually designed to satisfy. We also present an extensive survey of all lightweight symmetric primitives we are aware of. It covers designs from the academic community, from government agencies and proprietary algorithms which were reverse-engineered or leaked. Relevant national (nist...) and international (iso/iec...) standards are listed. We then discuss some trends we identified in the design of lightweight algorithms, namely the designers’ preference for arx-based and bitsliced-S-Box-based designs and simple key schedules. Finally, we argue that lightweight cryptography is too large a field and that it should be split into two related but distinct areas: ultra-lightweight and IoT cryptography. The former deals only with the smallest of devices for which a lower security level may be justified by the very harsh design constraints. The latter corresponds to low-power embedded processors for which the Aes and modern hash function are costly but which have to provide a high level security due to their greater connectivity. Keywords: Lightweight cryptography · Ultra-Lightweight · IoT · Internet of Things · SoK · Survey · Standards · Industry 1 Introduction The Internet of Things (IoT) is one of the foremost buzzwords in computer science and information technology at the time of writing.
    [Show full text]
  • Efficient Hashing Using the AES Instruction
    Efficient Hashing Using the AES Instruction Set Joppe W. Bos1, Onur Özen1, and Martijn Stam2 1 Laboratory for Cryptologic Algorithms, EPFL, Station 14, CH-1015 Lausanne, Switzerland {joppe.bos,onur.ozen}@epfl.ch 2 Department of Computer Science, University of Bristol, Merchant Venturers Building, Woodland Road, Bristol, BS8 1UB, United Kingdom [email protected] Abstract. In this work, we provide a software benchmark for a large range of 256-bit blockcipher-based hash functions. We instantiate the underlying blockci- pher with AES, which allows us to exploit the recent AES instruction set (AES- NI). Since AES itself only outputs 128 bits, we consider double-block-length constructions, as well as (single-block-length) constructions based on RIJNDAEL- 256. Although we primarily target architectures supporting AES-NI, our frame- work has much broader applications by estimating the performance of these hash functions on any (micro-)architecture given AES-benchmark results. As far as we are aware, this is the first comprehensive performance comparison of multi- block-length hash functions in software. 1 Introduction Historically, the most popular way of constructing a hash function is to iterate a com- pression function that itself is based on a blockcipher (this idea dates back to Ra- bin [49]). This approach has the practical advantage—especially on resource-constrained devices—that only a single primitive is needed to implement two functionalities (namely encrypting and hashing). Moreover, trust in the blockcipher can be conferred to the cor- responding hash function. The wisdom of blockcipher-based hashing is still valid today. Indeed, the current cryptographic hash function standard SHA-2 and some of the SHA- 3 candidates are, or can be regarded as, blockcipher-based designs.
    [Show full text]
  • Kalyna Country Tourism Development Strategy
    KALYNA COUNTRY TOURISM DEVELOPMENT STRATEGY Table of Contents EXECUTIVE SUMMARY ..............................................................................................................5 INTRODUCTION ........................................................................................................................10 Background..........................................................................................................................10 Project Objectives................................................................................................................11 Process Overview................................................................................................................11 SITUATION ASSESSMENT: Where are we now? ....................................................................16 Study Area...............................................................................................................................17 Themes ...................................................................................................................................18 Lures and Clusters: Kalyna’s Tourism Resource ....................................................................19 Key Attractions and Clusters ...............................................................................................19 Market Analysis .......................................................................................................................27 Trends in Alberta Tourism ...................................................................................................27
    [Show full text]
  • Exponential S-Boxes: a Link Between the S-Boxes of Belt and Kuznyechik/Streebog
    Exponential S-Boxes: a Link Between the S-Boxes of BelT and Kuznyechik/Streebog Léo Perrin and Aleksei Udovenko SnT, University of Luxembourg {leo.perrin,aleksei.udovenko}@uni.lu Abstract. The block cipher Kuznyechik and the hash function Streebog were recently standardized by the Russian Federation. These primitives use a common 8-bit S-Box, denoted 휋, which is given only as a look-up table. The rationale behind its design is, for all practical purposes, kept secret by its authors. In a paper presented at Eurocrypt 2016, Biryukov et al. reverse-engineered this S-Box and recovered an unusual Feistel-like structure relying on finite field multiplications. In this paper, we provide a new decomposition of this S-Box and describe how we obtained it. The first step was the analysis of the 8-bit S-Box of the current standard block cipher of Belarus, BelT. This S-Box is a variant of a so-called exponential substitution, a concept we generalize into pseudo-exponential substitution. We derive distinguishers for such permutations based on properties of their linear approximation tables and notice that 휋 shares some of them. We then show that 휋 indeed has a decomposition based on a pseudo-exponential substitution. More precisely, we obtain a simpler structure based on an 8-bit finite field exponentiation, one 4-bit S-Box, a linear layer and a few modular arithmetic operations. We also make several observations which may help cryptanalysts attempting to reverse-engineer other S-Boxes. For example, the visual pattern used in the previous work as a starting point to decompose 휋 is mathematically formalized and the use of differential patterns involving operations other than exclusive-or is explored.
    [Show full text]
  • A Lightweight Encryption Algorithm for Secure Internet of Things
    Pre-Print Version, Original article is available at (IJACSA) International Journal of Advanced Computer Science and Applications, Vol. 8, No. 1, 2017 SIT: A Lightweight Encryption Algorithm for Secure Internet of Things Muhammad Usman∗, Irfan Ahmedy, M. Imran Aslamy, Shujaat Khan∗ and Usman Ali Shahy ∗Faculty of Engineering Science and Technology (FEST), Iqra University, Defence View, Karachi-75500, Pakistan. Email: fmusman, [email protected] yDepartment of Electronic Engineering, NED University of Engineering and Technology, University Road, Karachi 75270, Pakistan. Email: firfans, [email protected], [email protected] Abstract—The Internet of Things (IoT) being a promising and apply analytics to share the most valuable data with the technology of the future is expected to connect billions of devices. applications. The IoT is taking the conventional internet, sensor The increased number of communication is expected to generate network and mobile network to another level as every thing mountains of data and the security of data can be a threat. The will be connected to the internet. A matter of concern that must devices in the architecture are essentially smaller in size and be kept under consideration is to ensure the issues related to low powered. Conventional encryption algorithms are generally confidentiality, data integrity and authenticity that will emerge computationally expensive due to their complexity and requires many rounds to encrypt, essentially wasting the constrained on account of security and privacy [4]. energy of the gadgets. Less complex algorithm, however, may compromise the desired integrity. In this paper we propose a A. Applications of IoT: lightweight encryption algorithm named as Secure IoT (SIT).
    [Show full text]
  • Provably Secure Counter Mode with Related Key-Based Internal Re-Keying
    Related keys CTRR mode and its security estimation Related-key cryptanalysis of Kuznyechik Provably secure counter mode with related key-based internal re-keying Goncharenko K. Moscow State University, al [email protected], Alekseev E. CryptoPro LLC, Ph.D., [email protected], Marshalko G. Technical committee for standardization (TC26), marshalko [email protected]. May 30,Provably 2018 secure counter mode with related key-based internal re-keying Related keys CTRR mode and its security estimation Related-key cryptanalysis of Kuznyechik It is very important to analyse block ciphers in related-key model! Why? Because situation when a lot of key relations are known can emerge when key generating machine is broken. Or just key generation algorithm is poor (like it was in WEP). Provably secure counter mode with related key-based internal re-keying Related keys CTRR mode and its security estimation Related-key cryptanalysis of Kuznyechik One can consider this motivation to be inconvincing and the problem of related-key analysis to be just an entertaining task. There are much less papers on this topic than on classic methods. As a result we still have no published related-keys analysis on Kuznyechik! Provably secure counter mode with related key-based internal re-keying Related keys CTRR mode and its security estimation Related-key cryptanalysis of Kuznyechik Provably secure counter mode with related key-based internal re-keying I some protocols may use related keys by design to generate key material easier and faster (such a cryptosystem is discussed in our work). Related keys CTRR mode and its security estimation Related-key cryptanalysis of Kuznyechik However the motivation can be adjusted with more real examples, when related keys appear (Razali E., Phan R.C.-W.: On The Existence of Related-Key Oracles in Cryptosystems based on Block Ciphers).
    [Show full text]
  • The Sword, November 2020
    NOVEMBER 2020 VOLUME 59 | ISSUE 3 2 Marginalized Students at Concordia Share Grievances: Recent Sit-In BY MARYKATE FENSTERMAKER 6 Milestone in Catholic History with First African American Cardinal BY ERIKA SOUKUP 8 How to Enjoy Thanksgiving Without Killing Grandma BY RYAN SKILLE 11 CSP Baseball Team Sends Uniforms to Nicaragua BY DAVINA BELLINGER 20 Criminal Justice & Sociology Club holds Open Conversation BY REBECCA BEASLEY Photo Credit: Rene Elias *THIS IS NOT AN OFFICIAL CSP PUBLICATION AND DOES NOT NECESSARILY REFLECT THE VIEWS OF THE ADMINISTRATION, FACULTY, OR STAFF. SPECIAL THANKS TO THE CONTRIBUTING SPONSORS. 1 THE SWORD NEWSPAPER NOVEMBER 2020 VOLUME 59 | ISSUE 3 NEWS CONCORDIA ST. PAUL’S OFFICIAL STUDENT NEWSPAPER SINCE 1966 EDITOR IN CHIEF Anna Fritze Letter from the Editor Marginalized Students at Concordia ART DIRECTOR BY ANNA FRITZE Share Grievances: Recent Sit-In Carli Bruckmueller alloween has come and gone, the u.s. NEWS EDITOR is in its second wave of the coronavirus, and our Organized by Black Students Harry Lien H nation will have a new president in January. What a roller coaster this month has been. So, it’s pretty Challenges Administration SPORTS EDITOR much been like every other month since March! Crazy Jaid Perry BY MARYKATE FENSTERMAKER what America can throw at you. ARTS & VARIETY EDITOR Before I released last month’s issue, I was most expectant group of around 30 students staged a sit-on in the Tunnel on Friday Oct. Davina Bellinger of receiving negative feedback due to the majority of the 30th to express their dissatisfaction with Concordia’s response to Black students paper taking the liberal side of the election.
    [Show full text]
  • Ethical Hacking
    Official Certified Ethical Hacker Review Guide Steven DeFino Intense School, Senior Security Instructor and Consultant Contributing Authors Barry Kaufman, Director of Intense School Nick Valenteen, Intense School, Senior Security Instructor Larry Greenblatt, Intense School, Senior Security Instructor Australia • Brazil • Japan • Korea • Mexico • Singapore • Spain • United Kingdom • United States Official Certified Ethical Hacker © 2010 Course Technology, Cengage Learning Review Guide ALL RIGHTS RESERVED. No part of this work covered by the copyright herein Steven DeFino may be reproduced, transmitted, stored or used in any form or by any means Barry Kaufman graphic, electronic, or mechanical, including but not limited to photocopying, Nick Valenteen recording, scanning, digitizing, taping, Web distribution, information networks, Larry Greenblatt or information storage and retrieval systems, except as permitted under Section 107 or 108 of the 1976 United States Copyright Act, without the prior Vice President, Career and written permission of the publisher. Professional Editorial: Dave Garza Executive Editor: Stephen Helba For product information and technology assistance, contact us at Managing Editor: Marah Bellegarde Cengage Learning Customer & Sales Support, 1-800-354-9706 For permission to use material from this text or product, Senior Product Manager: submit all requests online at www.cengage.com/permissions Michelle Ruelos Cannistraci Further permissions questions can be e-mailed to Editorial Assistant: Meghan Orvis [email protected]
    [Show full text]
  • The MALICIOUS Framework: Embedding Backdoors Into Tweakable Block Ciphers
    The MALICIOUS Framework: Embedding Backdoors into Tweakable Block Ciphers Thomas Peyrin, Haoyang Wang August 2020 School of Physical and Mathematical Sciences, Nanyang Technological University, Singapore 1 Introduction Backdoors • Most of time, backdoors of an encryption system refer to those weakness intentionally created in the implementation level, such as protocols of key management and key escrow. • The other type is the cryptographic backdoor, which is embedded during the design phase of a cryptographic algorithm. Known examples: Dual EC DBRG. • The suspicious S-box of Kuznyechik and Streebog. • 2 Academic Research Limited number of works focus on the research of cryptographic backdoors. Almost all designs were either broken or can't provide solid security proof. Our contributions • We propose the MALICIOUS framework to embed backdoors into tweakable block ciphers. • We show that our backdoor is efficient. • We provide a concrete security bound for our backdoor. • We provide a cipher example LowMC-M, and give proofs of its backdoor security and classical cipher security. 3 The MALICIOUS Framework Tweakable block ciphers Key Plaintext E Ciphertext Tweak A tweakable block cipher accepts an additional input, so-called tweak, in order to select the permutation computed by the cipher even if the key is fixed. • No need to keep the tweak secret. • An attacker could even have full control over the tweak, i.e., choosing whatever value he wants. 4 Block ciphers with partial non-linear layers Substitution-Permutation Network (SPN) SPN is a method of designing iterated block ciphers, an SPN round consists of a linear layer and a non-linear layer. Partial non-linear layer: the S S non-linear layer (S-boxes) is ··· only applied to a subpart of the internal state.
    [Show full text]
  • Rotational Rebound Attacks on Reduced Skein
    Rotational Rebound Attacks on Reduced Skein Dmitry Khovratovich1;2, Ivica Nikoli´c1, and Christian Rechberger3 1: University of Luxembourg; 2: Microsoft Research Redmond, USA; 3: Katholieke Universiteit Leuven, ESAT/COSIC, and IBBT, Belgium [email protected], [email protected], [email protected] Abstract. In this paper we combine the recent rotational cryptanalysis with the rebound attack, which results in the best cryptanalysis of Skein, a candidate for the SHA-3 competition. The rebound attack approach was so far only applied to AES-like constructions. For the first time, we show that this approach can also be applied to very different construc- tions. In more detail, we develop a number of techniques that extend the reach of both the inbound and the outbound phase, leading to rotational collisions for about 53/57 out of the 72 rounds of the Skein-256/512 com- pression function and the Threefish cipher. At this point, the results do not threaten the security of the full-round Skein hash function. The new techniques include an analytical search for optimal input values in the rotational cryptanalysis, which allows to extend the outbound phase of the attack with a precomputation phase, an approach never used in any rebound-style attack before. Further we show how to combine multiple inside-out computations and neutral bits in the inbound phase of the rebound attack, and give well-defined rotational distinguishers as certificates of weaknesses for the compression functions and block ciphers. Keywords: Skein, SHA-3, hash function, compression function, cipher, rotational cryptanalysis, rebound attack, distinguisher. 1 Introduction Rotational cryptanalysis and the rebound attack proved to be very effective in the analysis of SHA-3 candidates and related primitives.
    [Show full text]