DOCSLIB.ORG

Non-Vulnerable Data Transfer System Using Cryptography

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Non-Vulnerable Data Transfer System Using Cryptography International Journal of Engineering Research & Technology (IJERT) ISSN: 2278-0181 Vol. 1 Issue 8, October - 2012 Non-Vulnerable Data Transfer System Using Cryptography Dr K Venkata Rao PhD Kalpana Mogadati Professor, Dept. of CSE M.Tech,CSE Vignan’s Institute of Information- Vignan’s Institute of Information - Technology Technology Duvvada,Visakhapatnam Duvvada,Visakhapatnam Abstract -- The aim of the Paper is to provide the decrease the file size. It will increase the security during transmission of the data. transmission speed here maintains compression Commonly used technologies are cryptography, and decompression technique based on the GZIP Compression and decompression. This can be Algorithm. Than perform the cryptography used for secure and fast sending for security technique based on the TINY Encryption purpose we are using the Cryptography technology Algorithm. In sending process the TCP and to increase the file transfer speed we are using (Transaction control protocol) was involved. the compression and decompression technologies. Keywords – TINY, GZIP, TCP, In this paper we described lot of processes for cryptography, compression, secure data transmission. First perform the decompression compression and decompression techniques for IJERT INTRODUCTION System definition is the process of obtaining server was only a data base server that can only offer a clear understanding of the problem space such as data. Therefore majority of the business logic i.e., your business opportunities; user needs, or market validations etc. had to be placed on the clients environment and defining an application or system to system. This makes maintenance expensive. Such clients solve that problem. In the existing system, file transfer are called as fat clients. This also means that every is not a secured transaction. User Profiles and access client has to be trained as to how to use the controls are not integrated to provide higher-level application and even the security in the security in data transfer. Encryption and decryption communication is also the factor to be considered. implementation through a character user interface is Since the actual processing of the data takes a complicated process where the user or the place on the remote client the data has to be administrator is to follow some complex process. transported over the network, which requires a The information generated at the client side secured format of the transfer method. How to while under the standard of transfer should be secure conduct transactions is to be controlled by the client enough and protected by any intrusions and and advanced techniques implementing the interceptions that may occur while the information is cryptographic standards in the executing the data transferred. The overall system should concentrate transfer transactions. Present day transactions are on the best algorithm that can be implemented for al considered to be "un-trusted" in terms of security, i.e. the resource standards that can be implemented as they are relatively easy to be hacked. Nevertheless, per the standards of the technical quality. sensitive data transfer is to be carried out even if there In the traditional 2tierarchitecture there is lack of an alternative. Network security in the existed only the server and the client. In most cases the existing system is the motivation factor for a new www.ijert.org 1 International Journal of Engineering Research & Technology (IJERT) ISSN: 2278-0181 Vol. 1 Issue 8, October - 2012 system with higher-level security standards for the cryptanalysis of the Tiny Encryption Algorithm. In this information exchange to provide ease and secured file research we inspected the most common methods in the maintenance and management in a distributed cryptanalysis of a block cipher algorithm. TEA seems environment. to be highly resistant to differential cryptanalysis, and So in this paper we are going to propose that achieves complete diffusion (where a one bit the system should have the following features: The difference in the plaintext will cause approximately transactions should take place in a secured format 32-bit differences in the cipher text) after only between various clients in the network. The validation six rounds. Time performance on a modern desktop code should be placed on the server and not on the computer or workstation is very impressive. client such that file transfer takes place between only As computer systems become more pervasive and the registered users only. This leads to a thin client, complex, security is increasingly important. which is more desirable. The server should identify Cryptographic algorithms and protocols constitute the the type of request (GET/POST), file access central component of systems that protect network permissions and perform appropriate action. It should transmissions and store data. The security of such also identify the user and provide the communication systems greatly depends on the methods used to according to the prescribed level of security with manage, establish, and distribute the keys transfer of the file requested and run the required Employed by the cryptographic techniques. Even if a process at the server if necessary. When responding cryptographic algorithm is ideal in both theory and to the client, the server should send necessary implementation, the strength of the algorithm will be information such as User authorization and rendered useless if the relevant keys are poorly authentication information, Encryption, Decryption managed. types and their level of hierarchy etc. The following notation is necessary for our discussion. RELATED WORK • Hexadecimal numbers will be subscripted with“h,”e.g.,10=16h In this paper we are going to focus on this following Bitwise Shifts: The logical shift of x by y bits is techniques in-order to send the data securely using denoted by x << y. The logical right shift of x by y cryptography. bits is denoted by x >> y. Bitwise Rotations: A left rotation of x by y bits is Compress and Decompress Technique: denoted by x <<< y. A right rotation of x by y bits is denoted by x >>> y. This technique maps arbitrary input into printable Exclusive-OR: The operation of addition of n- tuples character output. The form of encoding has the over the field (also known as 2F exclusive-or )is following relevant characterstics. IJERT denoted by xΘy The range of function is a character set that is The Tiny Encryption Algorithm is a Fiestel type cipher universally re-presentable at all sites, not a specific that uses operations from mixed (orthogonal) algebraic binary encoding of the character set. Thus, the groups. A dual shift causes all bits of the data and key characters themselves can be encoded into whatever to be mixed repeatedly. The key schedule algorithm is form is needed by a specific system .For instance, the simple; the 128-bit key K is split into four 32-bit character is represented in ASCII system as a blocks K = ( K[0], K[1], K[2], K[3]). TEA seems to be hexadecimal hexadecimal 45 and in EDCDIC- based highly resistant to differential cryptanalysis and system a hexadecimal- c5.The character set consists of achieves complete diffusion (where a one bit 65 printable characters, one of which is used for difference in the plaintext will padding. With 2^6 = 64 available characters, each cause approximately 32 character can be used to represent 6 bits of input. bit differences in the cipher text). Time performance on a workstation is very impressive. No control characters are included in the set. Thus, the Block ciphers where the cipher text is calculated from message encoded in Radix-64 can traverse mail- the plain text by repeated application of the same handling system. That scans the data stream for control transformation or round function. In a Feistel cipher, characters. The hyphen character "- " is not included the text being encrypted is split into two halves. The round function, F, is applied to one half using a sub CryptographyTechnique (TinyEncryption) key and the output of F is (exclusive- or-ed (XORed)) The Tiny Encryption Algorithm (TEA) is a with the other half. The two halves are then swapped. cryptographic algorithm designed to minimize memory Each round follows the same pattern except for the footprint and maximize speed. It is a Feistel type last round where there is often no swap. The focus cipher that uses operations from mixed (orthogonal) of this thesis is the TEA Feistel Cipher algebraic groups. This research presents the www.ijert.org 2 International Journal of Engineering Research & Technology (IJERT) ISSN: 2278-0181 Vol. 1 Issue 8, October - 2012 The inputs to the encryption algorithm are a plaintext Fig:2 Internal Details of TEA block and a key K .The plaintext is P = (Left[0], Right[0]) and the cipher text is C =(Left[64], Above Figure2 presents the internal details of the Right[64]). The plaintext block is split into two halves, ith cycle of TEA. The round function, F, consists of Left[0] and Right[0]. Each half is used to encrypt the the key addition, bitwise XOR and left and right other half over 64 rounds of processing and then shift operation. We can describe the output (Left[i combine to produce the cipher text block. +1] , Right[i +1] ) of the ith cycle of TEA with the • Each round i has inputs Left[i-1] and Right[i-1], input (Left[i] ,Right[i]) as follows Left [i+1] = derived from the previous round, as well as a sub key Left[i] F ( Right[i], K [0, 1], delta[i] ),Right [i +1] = K[i] derived from the 128 bit overall K. Right[i] F ( Right[i +1], K [2, 3], delta[i] ), delta[i] • The sub keys K[i] are different from K and from = (i+1)/2 * delta, each other. The round function, F, is defined by 1/2 31 F(M,K[j,k],delta[i])=((M<<4)K[J]Θ(M • The constant delta =(5 -1)*2 =9E3779B h,IJERT is delta[i])Θ((M>>5)K[k]).
Load more

Recommended publications
  • Basic Cryptography
    Basic cryptography • How cryptography works... • Symmetric cryptography... • Public key cryptography... • Online Resources... • Printed Resources... I VP R 1 © Copyright 2002-2007 Haim Levkowitz How cryptography works • Plaintext • Ciphertext • Cryptographic algorithm • Key Decryption Key Algorithm Plaintext Ciphertext Encryption I VP R 2 © Copyright 2002-2007 Haim Levkowitz Simple cryptosystem ... ! ABCDEFGHIJKLMNOPQRSTUVWXYZ ! DEFGHIJKLMNOPQRSTUVWXYZABC • Caesar Cipher • Simple substitution cipher • ROT-13 • rotate by half the alphabet • A => N B => O I VP R 3 © Copyright 2002-2007 Haim Levkowitz Keys cryptosystems … • keys and keyspace ... • secret-key and public-key ... • key management ... • strength of key systems ... I VP R 4 © Copyright 2002-2007 Haim Levkowitz Keys and keyspace … • ROT: key is N • Brute force: 25 values of N • IDEA (international data encryption algorithm) in PGP: 2128 numeric keys • 1 billion keys / sec ==> >10,781,000,000,000,000,000,000 years I VP R 5 © Copyright 2002-2007 Haim Levkowitz Symmetric cryptography • DES • Triple DES, DESX, GDES, RDES • RC2, RC4, RC5 • IDEA Key • Blowfish Plaintext Encryption Ciphertext Decryption Plaintext Sender Recipient I VP R 6 © Copyright 2002-2007 Haim Levkowitz DES • Data Encryption Standard • US NIST (‘70s) • 56-bit key • Good then • Not enough now (cracked June 1997) • Discrete blocks of 64 bits • Often w/ CBC (cipherblock chaining) • Each blocks encr. depends on contents of previous => detect missing block I VP R 7 © Copyright 2002-2007 Haim Levkowitz Triple DES, DESX,
    [Show full text]
  • Rotational Cryptanalysis of ARX
    Rotational Cryptanalysis of ARX Dmitry Khovratovich and Ivica Nikoli´c University of Luxembourg [email protected], [email protected] Abstract. In this paper we analyze the security of systems based on modular additions, rotations, and XORs (ARX systems). We provide both theoretical support for their security and practical cryptanalysis of real ARX primitives. We use a technique called rotational cryptanalysis, that is universal for the ARX systems and is quite efficient. We illustrate the method with the best known attack on reduced versions of the block cipher Threefish (the core of Skein). Additionally, we prove that ARX with constants are functionally complete, i.e. any function can be realized with these operations. Keywords: ARX, cryptanalysis, rotational cryptanalysis. 1 Introduction A huge number of symmetric primitives using modular additions, bitwise XORs, and intraword rotations have appeared in the last 20 years. The most famous are the hash functions from MD-family (MD4, MD5) and their descendants SHA-x. While modular addition is often approximated with XOR, for random inputs these operations are quite different. Addition provides diffusion and nonlinearity, while XOR does not. Although the diffusion is relatively slow, it is compensated by a low price of addition in both software and hardware, so primitives with relatively high number of additions (tens per byte) are still fast. The intraword rotation removes disbalance between left and right bits (introduced by the ad- dition) and speeds up the diffusion. Many recently design primitives use only XOR, addition, and rotation so they are grouped into a single family ARX (Addition-Rotation-XOR).
    [Show full text]
  • Improved Masking for Tweakable Blockciphers with Applications to Authenticated Encryption
    Improved Masking for Tweakable Blockciphers with Applications to Authenticated Encryption Robert Granger1, Philipp Jovanovic2, Bart Mennink3, and Samuel Neves4 1 Laboratory for Cryptologic Algorithms, École polytechnique fédérale de Lausanne, Switzerland, [email protected] 2 Decentralized and Distributed Systems Lab, École polytechnique fédérale de Lausanne, Switzerland, [email protected] 3 Dept. Electrical Engineering, ESAT/COSIC, KU Leuven, and iMinds, Belgium, [email protected] 4 CISUC, Dept. of Informatics Engineering, University of Coimbra, Portugal, [email protected] Abstract. A popular approach to tweakable blockcipher design is via masking, where a certain primitive (a blockcipher or a permutation) is preceded and followed by an easy-to-compute tweak-dependent mask. In this work, we revisit the principle of masking. We do so alongside the introduction of the tweakable Even-Mansour construction MEM. Its masking function combines the advantages of word-oriented LFSR- and powering-up-based methods. We show in particular how recent advancements in computing discrete logarithms over finite fields of characteristic 2 can be exploited in a constructive way to realize highly efficient, constant-time masking functions. If the masking satisfies a set of simple conditions, then MEM is a secure tweakable blockcipher up to the birthday bound. The strengths of MEM are exhibited by the design of fully parallelizable authenticated encryption schemes OPP (nonce-respecting) and MRO (misuse-resistant). If instantiated with a reduced-round BLAKE2b permutation, OPP and MRO achieve speeds up to 0.55 and 1.06 cycles per byte on the Intel Haswell microarchitecture, and are able to significantly outperform their closest competitors.
    [Show full text]
  • Identifying Open Research Problems in Cryptography by Surveying Cryptographic Functions and Operations 1
    International Journal of Grid and Distributed Computing Vol. 10, No. 11 (2017), pp.79-98 http://dx.doi.org/10.14257/ijgdc.2017.10.11.08 Identifying Open Research Problems in Cryptography by Surveying Cryptographic Functions and Operations 1 Rahul Saha1, G. Geetha2, Gulshan Kumar3 and Hye-Jim Kim4 1,3School of Computer Science and Engineering, Lovely Professional University, Punjab, India 2Division of Research and Development, Lovely Professional University, Punjab, India 4Business Administration Research Institute, Sungshin W. University, 2 Bomun-ro 34da gil, Seongbuk-gu, Seoul, Republic of Korea Abstract Cryptography has always been a core component of security domain. Different security services such as confidentiality, integrity, availability, authentication, non-repudiation and access control, are provided by a number of cryptographic algorithms including block ciphers, stream ciphers and hash functions. Though the algorithms are public and cryptographic strength depends on the usage of the keys, the ciphertext analysis using different functions and operations used in the algorithms can lead to the path of revealing a key completely or partially. It is hard to find any survey till date which identifies different operations and functions used in cryptography. In this paper, we have categorized our survey of cryptographic functions and operations in the algorithms in three categories: block ciphers, stream ciphers and cryptanalysis attacks which are executable in different parts of the algorithms. This survey will help the budding researchers in the society of crypto for identifying different operations and functions in cryptographic algorithms. Keywords: cryptography; block; stream; cipher; plaintext; ciphertext; functions; research problems 1. Introduction Cryptography [1] in the previous time was analogous to encryption where the main task was to convert the readable message to an unreadable format.
    [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]
  • Differential Cryptanalysis of the Data Encryption Standard
    Differential Cryptanalysis of the Data Encryption Standard Eli Biham1 Adi Shamir2 December 7, 2009 1Computer Science Department, Technion – Israel Institute of Technology, Haifa 32000, Israel. Email: [email protected], WWW: http://www.cs.technion.ac.il/˜biham/. 2Department of Applied Mathematics and Computer Science, The Weizmann Institute of Science, Rehovot 76100, Israel. Email: [email protected]. This versionofthebookisprocessedfromtheauthor’soriginalLaTeXfiles,andmaybe differentlypaginatedthantheprintedbookbySpringer(1993). Copyright:EliBihamandAdiShamir. Preface The security of iterated cryptosystems and hash functions has been an active research area for many years. The best known and most widely used function of this type is the Data Encryption Standard (DES). It was developed at IBM and adopted by the National Bureau of Standards in the mid 70’s, and has successfully withstood all the attacks published so far in the open literature. Since the introduction of DES, many other iterated cryptosystems were developed, but their design and analysis were based on ad-hoc heuristic arguments, with no theoretical justification. In this book, we develop a new type of cryptanalytic attack which can be successfully applied to many iterated cryptosystems and hash functions. It is primarily a chosen plaintext attack but under certain circumstances, it can also be applied as a known plaintext attack. We call it “differen- tial cryptanalysis”, since it analyzes the evolution of differences when two related plaintexts are encrypted under the same key. Differential cryptanalysis is the first published attack which is capable of breaking the full 16-round DES in less than 255 complexity. The data analysis phase computes the key by analyzing about 236 ciphertexts in 237 time.
    [Show full text]
  • A Survey of ARX-Based Symmetric-Key Primitives
    397 International Journal of Communication Networks and Information Security (IJCNIS) Vol. 11, No. 3, December 2019 A Survey of ARX-based Symmetric-key Primitives Nur Fasihah Mohd Esa1, Shekh Faisal Abdul-Latip1 and Mohd Rizuan Baharon1 1INSFORNET Centre for Advanced Computing Technology, Fakulti Teknologi Maklumat dan Komunikasi, Universiti Teknikal Malaysia Melaka Abstract: Addition Rotation XOR is suitable for fast and fast software-oriented implementation. Nevertheless, the implementation symmetric –key primitives, such as stream and security properties are still not well studied in literature as block ciphers. This paper presents a review of several block and compared to SPN and Feistel ciphers. stream ciphers based on ARX construction followed by the Observation of addition from [4]: First, addition modulo discussion on the security analysis of symmetric key primitives n where the best attack for every cipher was carried out. We 2 on the window can be approximated by addition modulo benchmark the implementation on software and hardware platforms according to the evaluation metrics. Therefore, this paper aims at . Second, this addition gives a perfect approximation if providing a reference for a better selection of ARX design strategy. the carry into the window is estimated correctly. The probability distribution of the carry is generated, depending Keywords: ARX, cryptography, cryptanalysis, design, stream on the probability of approximation correctness. The ciphers, block ciphers. probability of the carry is independent of w; in fact, for 1. Introduction uniformly distributed addends it is , where The rapid development of today’s computing technology has is the position of the least significant bit in the window. made computer devices became smaller which in turn poses Thirdly, the probability of correctness for a random guess of a challenge to their security aspects.
    [Show full text]
  • Rotational Analysis of Chacha Permutation
    Rotational analysis of ChaCha permutation Stefano Barbero1, Emanuele Bellini2, and Rusydi Makarim2 1 Politecnico di Torino, Italy 2 Cryptography Research Centre, Technology Innovation Institute, UAE Abstract. We show that the underlying permutation of ChaCha20 stream cipher does not behave as a random permutation for up to 17 rounds with respect to rotational cryptanalysis. In particular, we derive a lower and an upper bound for the rotational probability through ChaCha quarter round, we show how to extend the bound to a full round and then to the full permutation. The obtained bounds show that the probability to find − what we call a parallel rotational collision is, for example, less than 2 488 for 17 rounds of ChaCha permutation, while for a random permutation − of the same input size, this probability is 2 511. We remark that our distinguisher is not an attack to ChaCha20 stream cipher, but rather a theoretical analysis of its internal permutation from the point of view of rotational cryptanalysis. Keywords: ChaCha20 · Stream Cipher · Rotational cryptanalysis · Per- mutation · Distinguisher arXiv:2008.13406v1 [math.CO] 31 Aug 2020 Table of Contents Rotational analysis of ChaCha permutation ......................... 1 Stefano Barbero, Emanuele Bellini, and Rusydi Makarim 1 Introduction....................................... ............ 2 1.1 Ourcontribution .................................... ...... 3 1.2 Outlineofthepaper .................................. ..... 3 1.3 Relatedworks...................................... ....... 3 2
    [Show full text]
  • An Overview on Cryptanalysis of ARX Ciphers
    An overview on cryptanalysis of ARX ciphers S. Barbero S. Barbero An overview on cryptanalysis of ARX ciphers ARX operations n n-bits strings: we essentially play in F2 and use the natural correspondence with Z2n n−1 n−2 x = (xn−1; xn−2;:::; x1; x0) $ xn−12 +xn−22 +···+x12+x0 n Addition : is the modular addiction mod 2 Rotation: nr and or respectively indicate a constant-distance left-rotation or right-rotation of r bits (r < n) of a n-bit word x (when will be clear from the − −! context, we will also use the notations x =nr x = x or ) x nr = (xn−r−1; xn−r−2;:::; x1; x0; xn−1;::: xn−r ) x or = (xr−1;:::; x1; x0; xn−1; xn−2;:::; xr ) XOR: ⊕ is the bitwise addition (exclusive OR) S. Barbero An overview on cryptanalysis of ARX ciphers Why ARX? ARX ciphers are block ciphers with very interesting advantages such as fast performance on PCs; compact implementation; easy algorithms; no timing attacks: in many other ciphers analyzing the time taken to execute cryptographic algorithms gives useful informations to the attacker in order to work backwards to the input, since the time of execution can differ based on the input; functionally completeness (assuming constants included): every possible logic gate can be realized as a network of gates using ARX operations and constants. S. Barbero An overview on cryptanalysis of ARX ciphers Basic disavantages of ARX On the other hand we have some disavantages not best trade–off in hardware, although there are some different attempts of optimizations for various ARX ciphers; it is still not so clear which is their security against some cryptanalytic tools such as linear and differential cryptanalysis, it is also still not so clear which is their security against side channel attacks, i.e.
    [Show full text]
  • Cryptanalysis of Symmetric Encryption Algorithms Colin Chaigneau
    Cryptanalysis of symmetric encryption algorithms Colin Chaigneau To cite this version: Colin Chaigneau. Cryptanalysis of symmetric encryption algorithms. Cryptography and Security [cs.CR]. Université Paris-Saclay, 2018. English. NNT : 2018SACLV086. tel-02012149 HAL Id: tel-02012149 https://tel.archives-ouvertes.fr/tel-02012149 Submitted on 8 Feb 2019 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. Cryptanalyse des algorithmes de chiffrement symetrique´ These` de doctorat de l’Universite´ Paris-Saclay prepar´ ee´ a` l’Universite´ de Versailles Saint-Quentin-en-Yvelines NNT : 2018SACLV086 Ecole doctorale n◦580 Sciences et Technologies de l’Information et de la Communication (STIC) Specialit´ e´ de doctorat : Mathematiques` et Informatique These` present´ ee´ et soutenue a` Versailles, le mercredi 28 novembre 2018, par Colin Chaigneau Composition du Jury : M. Louis GOUBIN Professeur, Universite´ de Versailles President´ Saint-Quentin-en-Yvelines, France M. Thierry BERGER Professeur Em´ erite,´ Universite´ de Limoges, France Rapporteur Mme. Mar´ıa NAYA-PLASENCIA Directrice de Recherche, INRIA Paris, France Rapporteure M. Patrick DERBEZ Maˆıtre de Conference,´ Universite´ de Rennes 1, France Examinateur Mme. Marine MINIER Professeure, Universite´ de Lorraine, France Examinatrice M. Gilles VAN ASSCHE Senior Principal Cryptographer, STMicroelectronics, Examinateur Belgique M.
    [Show full text]
  • Fast Keyed Hash/Pseudo-Random Function Using SIMD Multiply and Permute
    Fast keyed hash/pseudo-random function using SIMD multiply and permute J. Alakuijala, B. Cox, and J. Wassenberg Google Research February 7, 2017 Abstract HighwayHash is a new pseudo-random function based on SIMD multiply and permute instructions for thorough and fast hashing. It is 5.2 times as fast as SipHash for 1 KiB inputs. An open-source implementation is available under a permissive license. We discuss design choices and provide statistical analysis, speed measurements and preliminary cryptanalysis. Assuming it withstands further analysis, strengthened variants may also substantially accelerate file checksums and stream ciphers. 1 Introduction Hash functions are widely used for message authentication, efficient searching and `random' decisions. When attackers are able to find collisions (multiple inputs with the same hash result), they can mount denial of service attacks or disturb applications expecting uniformly distributed inputs. So-called `keyed-hash' functions prevent this by using a secret key to ensure the outputs arXiv:1612.06257v3 [cs.CR] 6 Feb 2017 are unpredictable. These functions are constructed such that an attacker who controls the inputs still cannot deduce the key, nor predict future outputs. The authors of SipHash refer to these as `strong pseudo-random functions' [1]. However, existing approaches are too slow for large-scale use. In this paper, we introduce two alternatives that are about 2 and 5 times as fast as SipHash. We are mainly interested in generating random numbers and message authentication, for which 64-bit hashes are sufficient. These are not `collision- resistant' because adversaries willing to spend considerable CPU time could 1 q π 64 find a collision after hashing about 2 2 inputs.
    [Show full text]
  • High-Speed, Hardware-Oriented Authenticated Encryption
    ICEPOLE: High-speed, Hardware-oriented Authenticated Encryption Pawe lMorawiecki1;2, Kris Gaj5, Ekawat Homsirikamol5, Krystian Matusiewicz8, Josef Pieprzyk3;4, Marcin Rogawski7, Marian Srebrny1;2, and Marcin W´ojcik6 1 Institute of Computer Science, Polish Academy of Sciences, Poland 2 Section of Informatics, University of Commerce, Kielce, Poland 3 Department of Computing, Macquarie University, Australia 4 Electrical Engineering and Computer Science School, Science and Engineering Faculty, Queensland University of Technology, Brisbane, Australia 5 Cryptographic Engineering Research Group, George Mason University, USA 6 Cryptography and Information Security Group, University of Bristol, United Kingdom 7 Cadence Design Systems, San Jose, USA 8 Intel, Gda´nsk,Poland Abstract. This paper introduces our dedicated authenticated encryption scheme ICEPOLE. ICE- POLE is a high-speed hardware-oriented scheme, suitable for high-throughput network nodes or generally any environment where specialized hardware (such as FPGAs or ASICs) can be used to provide high data processing rates. ICEPOLE-128 (the primary ICEPOLE variant) is very fast. On the modern FPGA device Virtex 6, a basic iterative architecture of ICEPOLE reaches 41 Gbits/s, which is over 10 times faster than the equivalent implementation of AES-128-GCM. The throughput-to-area ratio is also substantially better when compared to AES-128-GCM. We have carefully examined the security of the algorithm through a range of cryptanalytic techniques and our findings indicate that ICEPOLE offers high security level. Keywords: authenticated encryption scheme, authenticated cipher, ICEPOLE 1 Introduction Protocols such as SSL/TLS [12, 16], the backbone of the Internet, are designed to provide data confidentiality and authenticity. Often the underlying algorithms of these protocols realize en- cryption and authentication separately (e.g., AES in CBC mode for encryption and HMAC- SHA1 for authentication).
    [Show full text]