DOCSLIB.ORG

A Secure Communication Platform Based on Gemstone Yanjiao Chen, Jian Wang, and Ruming Yin Bo Liang

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
A Secure Communication Platform Based on Gemstone Yanjiao Chen, Jian Wang, and Ruming Yin Bo Liang 201O 3rd InternationalConference on AdvancedComputer Theoryand Engineering(ICACTE) A Secure Communication Platform Based on Gemstone Yanjiao Chen, Jian Wang, and Ruming Yin Bo Liang Dept. of Electronic Engineering, Tsinghua University AQSIQ Information Center Beijing 100084, China Beijing 100088, China [email protected] [email protected] Abstract-In this paper, we have implemented a secure FUBUKI based on a non-secure pseudo-random number communication platform based on a new stream cipher called generator (the mother generator) [9]. Gemstone which stems from coupled map lattices (CML), a Gemstone is also a candidate of eSTREAM, motivated nonlinear system of coupled chaotic maps. On the platform, we have realized duplex text, image and voice transmission. We by coupled map lattice (CML), a real-valued nonlinear have also analyzed the randomness of the keystream generated system of coupled chaotic maps [10]. While preserving good by the platform based on the statistical tests suggested by the confusion and diffusion property of CML, Gemstone National Institute of Standards and Technology (NIST). The properly discretizes the CML, improving the security as well test results are compared with other four stream ciphers'. as the performance. In addition, Gemstone is robust against Moreover, a series of experiments of duplex text, image and voice transmissions were made through university local IV setup attacks since there are no high probability network. Both the statistical test and the transmission difference propagations or high correlations over the IV experiments have shown that the platform is highly secure with setup scheme [10]. fast encryption speed, which confirms that the Gemstone In this paper, we have built a secure communication platform is promising for cryptographic applications. platform on which Gemstone is used for data encryption. We Keywords-CML (coupled map lattices); stream cipher; also set the statistical tests on the platform including Gemstone; encryption; decryption; statistical test. Frequency test, Runs test and Spectral test (also known as DFT test) to evaluate the randomness of the keystream. I. INTRODUCTION The results are compared with other four stream ciphers: th 20 century saw a rapid expansion of wireless Rabbit, FUBUKI, Yamb and a primitive algorithm based on communication. As wireless platforms grow in popularity CML (We refer to this algorithm as Chaotic algorithm in this and store valuable information, security is becoming an paper), which verify that the keystream generated by the important area of research and development. Encryption is a platform has ideal random properties. The experiments of conventional way to protect the wireless link. Compared duplex text, image and voice transmissions via university with block ciphers, stream ciphers can be faster and have local network have further proved that the platform can limited error propagation [1]. Therefore, stream ciphers are ensure security and fast encryption speed. widely adopted in wireless communication. For instance, The rest of the paper is organized as follows. Section 2 GSM uses the A5/I and A5/2 stream ciphers for ensuring gives brief introduction to Gemstone. The implementation of over-the-air voice privacy [2]; The EO stream cipher is used the secure communication platform is described in Section 3. for encrypting packets in Bluetooth [3]; In IEEE 802.11 In Section 4, we present the statistical test results. Also, a standard, Wireless Equivalent Privacy (WEP) uses the particular description of duplex image transmission on the stream cipher RC4 for confidentiality [4]; so does Wi-Fi platform is given. Conclusions and discussions are in Section Protected Access (WPA), a further enhancement of WEP. In 5. 2000, New European Schemes for Signatures, Integrity and Encryption (NESSIE) was funded to identify secure II. A BRIEF INTRODUCTION OF GEMSTONE cryptographic primitives. Stimulated by NESSIE, eSTREAM Gemstone is a synchronous stream cipher, using a I28-bit project arises to further promote the study of "new stream key K and a 64-bit initialization vector IV. A long ciphers that might become suitable for widespread adoption" pseudorandom key stream is generated based on the state [5]. variables and counter variables, after which the bitwise XOR There is a great number of stream cipher algorithms of the key stream and the plaintext is computed to produce proffered both in academia and in industry. Rabbit is one of ciphertext [10]. the candidates of the eSTREAM, proposed by Martin The 256-bit internal state of the cipher is divided into Boesgaard [6]. In [6] [7], a comprehensive security analysis eight I6-bit state variables Xi,n and eight I6-bit counter has been made, confirming Rabbit's resistance to some variables Ci,n • Xi,n is the i-th I6-bit state variable at iteration n conventional attacks. Yamb, another candidate, is described and Ci,n is the corresponding I6-bit counter variable. in details in [8]. MAKOTO MATSUMOTO has proposed 1) The state-update fu nction: 978-1-4244-6542-2/$26.00 © 2010 IEEE V2-527 2010 3rd International Conference on AdvancedComputer Theoryand Engineering(1CACTE) The state-update function is shown in Figure 1, in which S denotes iteration of discretized CML for times, i.e., (7) N 5 = EB Sl,n = x ,n EElx l,n ' so,n x4,n xo,n S(T) = VN (T +1)- 1, (1 ) In our previous work, we proved that there are no high where V represents discretized CML as (2). As for the parameters of S-box, A is usually set as 16409 probability difference propagations or high correlations over and N is 20. Addition modulo M=216 is chosen to modify the IV setup scheme. So Gemstone is resistant against the nearest neighbour coupling in CML. differential and linear cryptanalysis attacks [11 ]. We also Z showed the linear correlations between consecutive key {1 � l IS;;ZS;;A stream bits of Gemstone are below the safe bounds [10]. v(z)= (2) Thus, Gemstone should be very secure. l M<:-�Z)J + l, III. PLATFORM IMPLEMENTATION r--------� 1--------, The schematic figure of the secure communication I I g I I g C/." I I I platform is given in Figure 2. I I I I I I ... .. .. .. ... Xi,,,+1 : I 1--T1--II-+lD2 S21--'- 1 �-++- I r"'"'''''''''''''''''''' �;:,;,"� �--------... I y,... Ig"'l "i.. I /". L ________ -' L ________ I : :.i __________ J i Kcyslrcarn Figure 1. State-Update function. D denotes mixing transformation: lnSCClln: 11 00 ··· 1 channel 1110 ··· 0 D= 0111 ··· 0 (3) K�yslrcam Gemstone 1000 ··· 1 The counter variables are updated during each iteration Figure 2. Schematic figureof the secure communication platform based on according to a maximum-length LFSR as: Gemstone. lO] C(I5.. .! ] cI ,n+l =c l+l,n <l i,n ' 0 S;;i S;; 6 (4) IIS.. .! The platform consists of four modules: Encoding Module, = m <l ] , i =7 cl ,n+l 'r ct,n Encryption Module, Decryption Module and Decoding where <l denotes concatenation of two bit sequences and Module. The Encoding Module includes text/image entry 4 m= C11 5] EB C(I ] EB 19] EB lO] "f" 7,n 7,n c7,n cD,n • and sound recording. After input, the text, image or sound is transformed into byte streams which will be processed into 2) Key setup and IV setup: The counter variables are initiated with carefully selected the Encryption Module. Then, the plaintext is encrypted by values and the state variable with the key. Then, the Encryption Module into ciphertext, which will then be state-update function is iterated three times to spread the transmitted through insecure channel. In the Decoding influence of each key bit over all the state variable bits. Module, the byte streams are re-transformed into text/image Finally, the counter variables are modified as: or sound. The Encryption/Decryption Module is the core of C the platform, including parameter setting, IV key setup i,3=Ci,3EElXi,3' i=0,1, ···,7 (5) & and key generation. The 64-bit IV is divided into four 16-bit variables IVO, The interface of the platform is depicted in Figure 3 and lVI, IV2, IV3 and the state variables will be modified using Figure 4. The platform can conduct secure transmissions of the IV as follows: text, image and voice. i =0,1, 2,3 Figure 3 exhibits the typical interface of duplex secure (6) EB Xi,3= rv,_4 Xi,3' i =4, 5,6,7 text transmission. Once the "Connection Establishment" button is pressed, a dialog box pops out in which users can Then, the state-update function is iterated two times to input the "Local Address" and "Local Port" as well as spread the influence of each IV bit over all the state variable "Server Address" and "Server Port". Then, a link is bits. established which enables transmitter to send encrypted 3) Key stream generation: message to receiver in security. Both the plaintext and After each iteration, 64 bits of key stream are generated ciphertext are displayed on the two Textboxes. as (7). The encryption is processed by bitwise XOR of the key stream sn and the plaintext to form the ciphertext. V2-528 2010 3rd International Conference on AdvancedComputer Theoryand Engineering(1CACTE) secure text, image and voice transmission through university local network based on the platform. As the space is limited, we only elaborate on the result of secure image transmission here. The statistical tests and experiments are performed with Intel Pentium 4 3.00GHz processor and 2.00GB RAM. A. Statistical test Randomness is a probabilistic property. There are 3 steps to conduct a statistical test: 1) SpecifY the null hypothesis. In this paper, the null hypothesis (HO) is "the sequence under test is random"; 2) Compute randomness statistic; 3) Compute the P-value. If P-value � a, we demonstrate that the sequence is random.
Load more

Recommended publications
  • Secure Transmission of Data Using Rabbit Algorithm
    International Research Journal of Engineering and Technology (IRJET) e-ISSN: 2395 -0056 Volume: 04 Issue: 05 | May -2017 www.irjet.net p-ISSN: 2395-0072 Secure Transmission of Data using Rabbit Algorithm Shweta S Tadkal1, Mahalinga V Mandi2 1 M. Tech Student , Department of Electronics & Communication Engineering, Dr. Ambedkar institute of Technology,Bengaluru-560056 2 Associate Professor, Department of Electronics & Communication Engineering, Dr. Ambedkar institute of Technology,Bengaluru-560056 ---------------------------------------------------------------------***----------------------------------------------------------------- Abstract— This paper presents the design and simulation of secure transmission of data using rabbit algorithm. The rabbit algorithm is a stream cipher algorithm. Stream ciphers are an important class of symmetric encryption algorithm, which uses the same secret key to encrypt and decrypt the data and has been designed for high performance in software implementation. The data or the plain text in our proposed model is the binary data which is encrypted using the keys generated by the rabbit algorithm. The rabbit algorithm is implemented and the language used to write the code is Verilog and then is simulated using Modelsim6.4a. The software tool used is Xilinx ISE Design Suit 14.7. Keywords—Cryptography, Stream ciphers, Rabbit algorithm 1. INTRODUCTION In today’s world most of the communications done using electronic media. Data security plays a vitalkrole in such communication. Hence there is a need to predict data from malicious attacks. This is achieved by cryptography. Cryptographydis the science of secretscodes, enabling the confidentiality of communication through an in secure channel. It protectssagainstbunauthorizedapartiesoby preventing unauthorized alterationhof use. Several encrypting algorithms have been built to deal with data security attacks.
    [Show full text]
  • New Algorithms and Architectures for Arithmetic in GF (2 M) Suitable For
    AN ABSTRACT OF THE THESIS OF Francisco RodrIguez-HenrIquez for the degree of Doctor of Philosophy in Electrical & Computer Engineering presented on June 07, 2000. Title:New Algorithms and Architectures for Arithmetic in GF(2m Suitable for Elliptic Curve Cryptography Redacted for Privacy Abstract approved: cetin K. Koç During the last few years we have seen formidable advances in digital and mo- bile communication technologies such as cordless and cellular telephones, personal communication systems, Internet connection expansion, etc. The vast majority of digital information used in all these applications is stored and also processed within a computer system, and then transferred between computers via fiber optic, satellite systems, and/or Internet. In all these new scenarios, secure information transmission and storage has a paramount importance in the emerging interna- tional information infrastructure, especially, for supporting electronic commerce and other security related services. The techniques for the implementation of secure information handling and management are provided by cryptography, which can be succinctly defined as the study of how to establish secure communication in an adversarial environ- ment. Among the most important applications of cryptography, we can mention data encryption, digital cash, digital signatures, digital voting, network authenti- cation, data distribution and smart cards. The security of currently used cryptosystems is based on the computational complexity of an underlying mathematical problem, such as factoring largenum- bers or computing discrete logarithms for large numbers. These problems,are believed to be very hard to solve. In the practice, only a small number of mathe- matical structures could so far be applied to build public-key mechanisms.
    [Show full text]
  • On the Use of Continued Fractions for Stream Ciphers
    On the use of continued fractions for stream ciphers Amadou Moctar Kane Département de Mathématiques et de Statistiques, Université Laval, Pavillon Alexandre-Vachon, 1045 av. de la Médecine, Québec G1V 0A6 Canada. [email protected] May 25, 2013 Abstract In this paper, we present a new approach to stream ciphers. This method draws its strength from public key algorithms such as RSA and the development in continued fractions of certain irrational numbers to produce a pseudo-random stream. Although the encryption scheme proposed in this paper is based on a hard mathematical problem, its use is fast. Keywords: continued fractions, cryptography, pseudo-random, symmetric-key encryption, stream cipher. 1 Introduction The one time pad is presently known as one of the simplest and fastest encryption methods. In binary data, applying a one time pad algorithm consists of combining the pad and the plain text with XOR. This requires the use of a key size equal to the size of the plain text, which unfortunately is very difficult to implement. If a deterministic program is used to generate the keystream, then the system will be called stream cipher instead of one time pad. Stream ciphers use a great deal of pseudo- random generators such as the Linear Feedback Shift Registers (LFSR); although cryptographically weak [37], the LFSRs present some advantages like the fast time of execution. There are also generators based on Non-Linear transitions, examples included the Non-Linear Feedback Shift Register NLFSR and the Feedback Shift with Carry Register FCSR. Such generators appear to be more secure than those based on LFSR.
    [Show full text]
  • Grein a New Non-Linear Cryptoprimitive
    UNIVERSITY OF BERGEN Grein A New Non-Linear Cryptoprimitive by Ole R. Thorsen Thesis for the degree Master of Science December 2013 in the Faculty of Mathematics and Natural Sciences Department of Informatics Acknowledgements I want to thank my supervisor Tor Helleseth for all his help during the writing of this thesis. Further, I wish to thank the Norwegian National Security Authority, for giving me access to their Grein cryptosystem. I also wish to thank all my colleagues at the Selmer Centre, for all the inspiring discus- sions. Most of all I wish to thank prof. Matthew Parker for all his input, and my dear friends Stian, Mikal and Jørgen for their spellchecking, and socialising in the breaks. Finally, I wish to thank my girlfriend, Therese, and my family, for their continuous sup- port during the writing of this thesis. Without you, this would not have been possible. i Contents Acknowledgementsi List of Figures iv List of Tablesv 1 Introduction1 2 Cryptography2 2.1 Classical Cryptography............................3 2.2 Modern Cryptography.............................4 3 Stream Ciphers5 3.1 Stream Cipher Fundamentals.........................5 3.2 Classification of Stream Ciphers........................6 3.3 One-Time Pad.................................7 4 Building Blocks8 4.1 Boolean Functions...............................8 4.1.1 Cryptographic Properties....................... 10 4.2 Linear Feedback Shift Registers........................ 11 4.2.1 The Recurrence Relation....................... 12 4.2.2 The Matrix Method.......................... 12 4.2.3 Characteristic Polynomial....................... 13 4.2.4 Period of a Sequence.......................... 14 4.3 Linear Complexity............................... 16 4.4 The Berlekamp-Massey Algorithm...................... 16 4.5 Non-Linear Feedback Shift Registers....................
    [Show full text]
  • CS 4005-705-01 Cryptography I Prof
    CS 4005-705-01 Cryptography I Prof. Alan Kaminsky Graduate Project: Team: “The Number Crunchers” Members: Sharif Hdairis Andrew Hoffman Nelson Powell Introduction Cryptography has progressed significantly from the days of substitution and affine ciphers, to the modern block and stream ciphers based on high order mathematics. This course provides an introduction to the fundamentals of cryptography as it applies to the field of security via the examination of both cryptography and cryptanalysis. This project focuses an empirical investigation on the statistical attributes of stream ciphers, specifically using the published Rabbit Stream Cipher with respect to the randomness of the key stream. The Rabbit Cipher algorithm is a stream cipher utilizing a 128-bit secret key with a 64- bit Initialization Vector (IV) [1][2]. The Rabbit Cipher efficiently encrypts 128-bits per iteration of the algorithm in a synchronous manner to provide an effective ciphered bit stream. The cipher was implemented using the Java language with the intent to utilize the Parallel Java Library [3] as provided by Dr. Alan Kaminsky. Using Object Oriented Design (OOD), the components of the cipher were abstracted in an effort to maximize the utility of fundamental components as well as provide for a possible context based encryption environment. The fundamental components were validated against test sets[2][4] to ensure functional compliance. This statistical analysis test suite TestU01 was used to determine the probability of randomness in cipher’s key stream. Since the Rabbit cipher uses four iterations to mix the key followed by four iterations to mix the IV, the analysis examines the effects on randomness within the keystream with respect to the number of initialization rounds.
    [Show full text]
  • Design and Analysis of RC4-Like Stream Ciphers
    Design and Analysis of RC4-like Stream Ciphers by Matthew E. McKague A thesis presented to the University of Waterloo in fulfillment of the thesis requirement for the degree of Master of Mathematics in Combinatorics and Optimization Waterloo, Ontario, Canada, 2005 c Matthew E. McKague 2005 I hereby declare that I am the sole author of this thesis. This is a true copy of the thesis, including any required final revisions, as accepted by my examiners. I understand that my thesis may be made electronically available to the public. Matthew E. McKague ii Abstract RC4 is one of the most widely used ciphers in practical software ap- plications. In this thesis we examine security and design aspects of RC4. First we describe the functioning of RC4 and present previously published analyses. We then present a new cipher, Chameleon which uses a similar internal organization to RC4 but uses different methods. The remainder of the thesis uses ideas from both Chameleon and RC4 to develop design strategies for new ciphers. In particular, we develop a new cipher, RC4B, with the goal of greater security with an algorithm comparable in simplicity to RC4. We also present design strategies for ciphers and two new ciphers for 32-bit processors. Finally we present versions of Chameleon and RC4B that are implemented using playing-cards. iii Acknowledgements This thesis was undertaken under the supervision of Alfred Menezes at the University of Waterloo. The cipher Chameleon was developed under the supervision of Allen Herman at the University of Regina. Financial support was provided by the University of Waterloo, the University of Regina and the National Science and Engineering Research Council of Canada (NSERC).
    [Show full text]
  • Computer Science and Cybersecurity (Cs&Cs
    ISSN 2519-2310 CS&CS, Issue 3(11) 2018 UDC 004.056.55 STATISTICAL PROPERTIES OF MODERN STREAM CIPHERS Oleksii Nariezhnii, Egor Eremin, Vladislav Frolenko, Kyrylo Chernov, Tetiana Kuznetsova, Yevhen Demenko V. N. Karazin Kharkiv National University, 6 Svobody Sq., Kharkiv, 61022, Ukraine [email protected], [email protected], [email protected], [email protected], [email protected], [email protected] Reviewer: Ivan Gorbenko, Doctor of Sciences (Engineering), Full Professor, Academician of the Academy of Applied Radioelec- tronics Sciences, V. N. Karazin Kharkiv National University, 4 Svobody Sq., Kharkiv, 61022, Ukraine [email protected] Received on September 2018 Abstract. In recent years, numerous studies of stream symmetric ciphers in Ukraine are continuing, the main purpose of which is to argue the principles of creating a new cryptographic algorithm, which can be based on the national standard. One of the essential aspects in choosing from many alternatives is the statistical properties of the output pseudorandom sequence (key stream). In this paper, the results of comparative studies of statistical properties of out- put sequences, which are formed by various stream ciphers, in particular, by world-known algorithms Enocoro, Dec- im, Grain, HC, MUGI, Mickey, Rabbit, RC-4, Salsa20, SNOW2.0, Sosemanuk, Trivium and the Ukrainian crypto- graphic algorithm Strumok, that was developed in recent years, are presented. For comparative studies, the NIST STS method was used, according to which experimental studies are performed in 15 statistical tests, the purpose of which is to determine the randomness of the output binary sequences. Each of the tests is aimed at studying certain vulnerabilities of the generator, that is, points to the potential usage of different methods of cryptographic analysis.
    [Show full text]
  • Hardware Framework for the Rabbit Stream Cipher
    Hardware Framework for the Rabbit Stream Cipher Deian Stefan? S∗ProCom2// Dept. of Electrical Engineering, The Cooper Union, New York NY 10003, USA Abstract. Rabbit is a software-oriented synchronous stream cipher with very strong security properties and support for 128-bit keys. Rabbit is part of the European Union's eSTREAM portfolio of stream ciphers addressing the need for strong and computationally efficient (i.e., fast) ciphers. Extensive cryptanalysis confirms Rabbit's strength against mod- ern attacks; attacks with complexity lower than an exhaustive key search have not been found. Previous software implementations have demon- strated Rabbit's high throughput, however, the performance in hardware has only been estimated. Three reconfigurable hardware designs of the Rabbit stream cipher { direct, interleaved and generalized folded struc- ture (GFS) { are presented. On the Xilinx Virtex-5 LXT FPGA, a direct, resource-efficient (568 slices) implementation delivers throughputs of up to 9.16 Gbits/s, a 4-slow interleaved design reaches 25.62 Gbits/s using 1163 slices, and a 3-slow 8-GFS implementations delivers throughputs of up to 3.46 Gbits/s using only 233 slices. Key words: FPGA, Rabbit, eSTREAM, DSP, Stream Cipher 1 Introduction The widespread use of embedded mobile devices poses the need for fast, hardware-oriented encryption capabilities to provide higher security and protection of private data for end users. Stream ciphers are cryptographic algorithms that transform a stream of plaintext messages of varying bit- length into ciphertext of the same length, usually by generating a keystream that is then XORed with the plaintext. In general, stream ciphers have very high throughput, strong security properties, and use few resources, thus making them ideal for mobile applications; well-known examples of stream ciphers include the RC4 cipher used in 802.11 Wireless Encryp- tion Protocol [13], E0 cipher used in Bluetooth protocol [13], and the SNOW 3G cipher used by the 3GPP group in the new mobile cellular standard [26].
    [Show full text]
  • LAN Crypto Submission to the ECRYPT Stream Cipher Project
    22 Schepkina Str., Office 22 Moscow, RUSSIA 129090 www.lancrypto.com Tel.: +7 / 095 / 974.76.60 /61/62/63 Fax: +7 / 095 / 974.76.59 E-mail: [email protected] 24.04.2005 # 7175-B LAN Crypto Submission to the ECRYPT Stream Cipher Project. B. Primitive specification and supporting documentation. 1. Description of the Primitive “Yamb”. The Cipher name is “Yamb” («Ямб» in Cyrillic) Stream cipher Yamb is a synchronous encryption algorithm that allows keys of any length in the range 80–256 bits and allows initial vectors IV of any length in the range 32-128 bits. Recommended values (bits) of key length are: 80, 96, 112, 128, 144, 160, 176, 192, 208, 224, 240 or 256 Recommended values of IV length (bits) are the following: 32, 64, 96 or 128. Structure of the algorithm Yamb. Graphic scheme of the algorithm Yamb is on Picture 1. Algorithm Yamb consists of the following three parts: • Linear Feedback Shift Register (LFSR) L of length 15 over GF(232), • Nonlinear function FM,(32-bit input and 32-bit output), which uses dinamic memory M of 256 Bytes, 32 • Shift register R of length 16 over Z 2 . All parts of the algorithm Yamb exchange data by 32-bit blocks, i.e. we can think of data blocks as of binary vectors of length 32, or as of the elements of V32 – linear space over GF(2). 32 Register L is represented over GF(2 ) in its canonic presentation F2[x]/g(x), where g(x) = x32 + x27 + x24 + x20 + x19 + x17 + x16 + x12 + x10 + x9 + x8 + x7 + x6 + x3 + 1 is a primitive polynomial over a field GF(2).
    [Show full text]
  • The Rabbit Embedded Security Pack
    The Rabbit Embedded Security Pack The Rabbit Embedded Security Pack is a Dynamic C add-on module. It is composed of three main soft- ware packages: • SSL/TLS1 • AES • Wi-Fi Enterprise Mode Authentication SSL is essentially an encryption framework protocol and AES is one of the strongest encryption standards that can be selected for use within an SSL-secured communications channel. The AES software package can also be used independently from the SSL software. SSL is discussed in Section 1 and the AES protocol is discussed in Section 2. Wi-Fi Enterprise mode authentication uses the most secure protocols available to ensure mutual authentication and efficient dynamic key distribution. Also known as WPA-Enterprise and/or WPA2- Enterprise, this topic is discussed in Section 3. The Rabbit Embedded Security Pack is available for purchase on the Rabbit web site: www.rabbit.com/store/index.shtml Documentation for the security pack is also available online (follow the link for Dynamic C): www.rabbit.com/docs/ Uses for the Rabbit Embedded Security Pack are many. Any application that needs to transmit data over an unsecured network is a potential candidate. The Rabbit Embedded Security Pack provides security, and more importantly, peace of mind. It protects your data from eavesdroppers and tampering. The following are potential applications for the Rabbit Embedded Security Pack. • Internet-enabled vending machines • Internet-enabled home automation systems • Network-enabled medical devices • Web-configurable telephone switches • Remote-entry configuration • Internet-enabled monitoring and billing 1. The IETF TLS 1.0 is the most widely-used standard for SSL, replacing Netscape’s SSL version 3.
    [Show full text]
  • Feasibility of Fault Analysis Based on Intentional Electromagnetic Interference
    Feasibility of Fault Analysis Based on Intentional Electromagnetic Interference Junko Takahashi #1, Yu-ichi Hayashi ∗2, Naofumi Homma ∗3, Hitoshi Fuji #4, and Takafumi Aoki ∗5 # NTT Secure Platform Laboratories, Nippon Telegraph and Telephone Corporation, 3-9-11 Midori-cho, Musashino-shi, Tokyo 180-8585, Japan f1takahashi.junko, [email protected] ∗ Tohoku University, 6-6-05, Aramaki Aza Aoba, Aoba-ku, Sendai-shi, 980-8579, Japan f2yu-ichi@m, [email protected], [email protected] Abstract—This paper presents the feasibility of fault analysis test capabilities to generate waveforms, and understanding the using intentional electromagnetic interference (IEMI). Fault anal- effects of IEMI on equipment, systems, communications, and ysis (FA) is a kind of implementation attack that intentionally measurements [4]. extracts a secret key embedded in a secure device such as a smart card. An attacker injects a computational fault during Previous studies of IEMI showed that devices can be the cryptographic calculation and he can extract a secret key. permanently damaged or destroyed by the effects of IEMI [4], Recently, Hayashi et al. showed that temporal faults could be [5]. On the other hand, Hayashi et al. recently showed that remotely injected during the cryptographic calculation using temporal faults could be remotely injected into a target device IEMI. They showed a case study in which an Advanced Standard of an attack without any damage to the device using IEMI Encryption (AES) secret key could be extracted through fault analysis. However, the characteristics of faults that can be techniques [6], [7], [8]. They showed that the temporal faults induced by IEMI were not described.
    [Show full text]
  • Automatické Hledání Závislostí U Proudových Šifer Projektu Estream
    MASARYKOVA UNIVERZITA F}w¡¢£¤¥¦§¨ AKULTA INFORMATIKY !"#$%&'()+,-./012345<yA| Automatické hledání závislostí u proudových šifer projektu eStream DIPLOMOVÁ PRÁCA Matej Prišt’ák Brno, Jaro 2012 Prehlásenie Prehlasujem, že táto diplomová práca je mojím pôvodným autorským dielom, ktoré som vypracoval samostatne. Všetky zdroje, pramene a literatúru, ktoré som pri vypracovaní po- užíval alebo z nich ˇcerpal,v práci riadne citujem s uvedením úplného odkazu na príslušný zdroj. Vedúci práce: Petr Švenda ii Pod’akovanie Rád by som pod’akoval v prvom rade vedúcemu práce RNDr. Petrovi Švendovi, Ph.D. za odborné vedenie, pravidelné zhodnotenie a pripomienky k práci. Pod’akovanie patrí aj ko- legovi Ondrejovi Dubovcovi za spoluprácu pri úpravách použitej aplikácie. Nakoniec by som chcel pod’akovat’ celej mojej rodine a priatel’ke Zuzke za podporu a trpezlivost’ poˇcas písania tejto práce. iii Zhrnutie Ciel’om práce je príprava existujúcich implementácií širšieho okruhu kandidátov na prú- dovú šifru v rámci projektu eSTREAM do jednotného rozhrania tak, aby bolo možné auto- matické hl’adanie nežiadúcich závislostí vo výstupe (ktoré by sa nemali vyskytovat’) všet- kých týchto kandidátnych funkcií naraz. Pre automatické hl’adanie bol využitý existujúci nástroj využívajúci techniky evoluˇcnýchobvodov. K dispozícii bola možnost’ spúšt’at’ vý- poˇctydistribuovane pomocou nástroja BOINC s využitím laboratórnych poˇcítaˇcov. Imple- mentaˇcnáˇcast’ je doplnená analýzou a diskusiou získaných výsledkov a porovnaním úspeš- nosti hl’adania závislostí evoluˇcnýmobvodom verzus závislosti nájdené bežnými batériami pre štatistické testovanie výstupu dát (Diehard a NIST). iv Kl’úˇcovéslová genetický algoritmus, genetic algorithm, prúdová šifra, stream cipher, ECRYPT, eSTREAM, kryptoanalýza, cryptoanalysis, štatistické testovanie, statistical testing v Obsah 1 Úvod .............................................1 2 Definícia pojmov ......................................2 2.1 Genetický algoritmus .................................2 2.1.1 Initializer .
    [Show full text]