scholarly journals On Distinguishing Attack Against the Reduced Version of the Cipher Nlsv2

2012 ◽  
Vol 53 (1) ◽  
pp. 21-32
Author(s):  
Michal Braško ◽  
Jaroslav Boor
Keyword(s):  
Stream Cipher ◽  
Stream Ciphers ◽  
Web Page ◽  
Security Issue ◽  
Phase 3 ◽  
Distinguishing Attack ◽  
De Vries ◽  
Practical Demonstration

ABSTRACT The Australian stream cipher NLSv2 [Hawkes, P.-Paddon, M.-Rose, G. G.-De Vries, M. W.: Primitive specification for NLSv2, Project eSTREAM web page, 2007, 1-25] is a 32-bit word oriented stream cipher that was quite successful in the stream ciphers competition-the project eSTREAM. The cipher achieved Phase 3 and successfully accomplished one of the main requirements for candidates in Profile 1 (software oriented proposals)-to have a better performance than AES in counter mode. However the cipher was not chosen into the final portfolio [Babbage, S.-De Canni`ere, Ch.-Canteaut, A.-Cid, C.-Gilbert, H.-Johansson, T.-Parker, M.-Preneel, B.-Rijmen, V.-Robshaw, M.: The eSTREAM Portfolio, Project eSTREAM web page, 2008], because its performance was not so perfect when comparing with other finalist. Also there is a security issue with a high correlation in the used S-Box, which some effective distinguishers exploit. In this paper, a practical demonstration of the distinguishing attack against the smaller version of the cipher is introduced. In our experiments, we have at disposal a machine with four cores (Intel® CoreTM Quad @ 2.66 GHz) and single attack lasts about 6 days. We performed successful practical experiments and our results demonstrate that the distingushing attack against the smaller version is working.

scholarly journals Performance and Statistical Analysis of Stream ciphers in GSM Communications

2020 ◽  
Vol 16 (1) ◽  
pp. 11-18 ◽  
Author(s):  
Nagendar Yerukala ◽  
V Kamakshi Prasad ◽  
Allam Apparao
Keyword(s):  
Statistical Analysis ◽  
Stream Cipher ◽  
Statistical Tests ◽  
Stream Ciphers ◽  
Test Suite ◽  
Secret Key ◽  
Initial State ◽  
Detailed Statistical Analysis ◽  
Almost All ◽  
The Given

For a stream cipher to be secure, the keystream generated by it should be uniformly random with parameter 1/2.Statistical tests check whether the given sequence follow a certain probability distribution. In this paper, we perform a detailed statistical analysis of various stream ciphers used in GSM 2G,3G, 4G and 5G communications. The sequences output by these ciphers are checked for randomness using the statistical tests defined by the NIST Test Suite. It should also be not possible to derive any information about secret key and the initial state ofthe cipher from the keystream. Therefore, additional statisticaltests based on properties like Correlation between Keystreamand Key, and Correlation between Keystream and IV are also performed. Performance analysis of the ciphers also has been done and the results tabulated. Almost all the ciphers pass thetests in the NIST test suite with 99% confidence level. For A5/3stream cipher, the correlation between the keystream and key is high and correlation between the keystream and IV is low when compared to other ciphers in the A5 family.

scholarly journals Security analysis of linearly filtered NLFSRs

2013 ◽  
Vol 7 (4) ◽  
pp. 313-332 ◽  
Author(s):  
Mohammad Ali Orumiehchiha ◽  
Josef Pieprzyk ◽  
Ron Steinfeld ◽  
Harry Bartlett
Keyword(s):  
Linear Combination ◽  
Mobile Communication ◽  
Stream Cipher ◽  
High Efficiency ◽  
Security Analysis ◽  
Linear Feedback ◽  
Attractive Feature ◽  
Key Recovery ◽  
Distinguishing Attack ◽  
Feedback Shift Register

Abstract. Non-linear feedback shift register (NLFSR) ciphers are cryptographic tools of choice of the industry especially for mobile communication. Their attractive feature is a high efficiency when implemented in hardware or software. However, the main problem of NLFSR ciphers is that their security is still not well investigated. The paper makes a progress in the study of the security of NLFSR ciphers. In particular, we show a distinguishing attack on linearly filtered NLFSR (or LF-NLFSR) ciphers. We extend the attack to a linear combination of LF-NLFSRs. We investigate the security of a modified version of the Grain stream cipher and show its vulnerability to both key recovery and distinguishing attacks.

scholarly journals Pengembangan Sistem Keamanan untuk E-Commerce

2017 ◽  
pp. 17
Author(s):  
I Gusti Ngurah Indra Saputra ◽  
Gusti Made Arya Sasmita ◽  
Anak Agung Ketut Agung Cahyawan Wiranatha
Keyword(s):  
Security System ◽  
Security Protocol ◽  
Secure Socket Layer ◽  
Web Page ◽  
Security Issue ◽  
Encrypted Data ◽  
Transaction Data ◽  
Transaction Process ◽  
Business To Consumer ◽  
Business To Business

E-commerce is a remote goods or services transaction activity between two company (business to business) or between company with customers (business to consumer). Ecommerce was simplifying the transaction process between producers and consumers, butthere is a risk of security issue if doing transactions on e-commerce. A common e-commercesecurity system using another protocol security e.g. SSL (Secure Socket Layer) so these ecommerce security system is very dependent with these security protocol. The e-commercesecurity problem was fixed by developed security system that using security system directly onthe web page. The system is designed to securing transaction data using RC6 encryption, RC6encryption key is secured by RSA encryption, and encrypted data is encoded by Base64. Theresulting security system is blocking transaction data when users clicking submit transactionbutton, then these transaction data encrypted using applied algorithm before send it into serverso transaction data was secured without aid of another security protocol e.g. SSL (SecureSocket Layer).

A Distinguishing Attack on a Fast Software-Implemented RC4-Like Stream Cipher

2007 ◽  
Vol 53 (9) ◽  
pp. 3250-3255 ◽  
Author(s):  
Yukiyasu Tsunoo ◽  
Teruo Saito ◽  
Hiroyasu Kubo ◽  
Tomoyasu Suzaki
Keyword(s):  
Stream Cipher ◽  
Distinguishing Attack

scholarly journals Vectorized linear approximations for attacks on SNOW 3G

2020 ◽  
pp. 249-271
Author(s):  
Jing Yang ◽  
Thomas Johansson ◽  
Alexander Maximov
Keyword(s):  
Stream Cipher ◽  
Key Recovery ◽  
Distinguishing Attack ◽  
Linear Approximations ◽  
Correlation Attack ◽  
Finite State ◽  
Integrity Protection ◽  
Key Length ◽  
Expected Complexity ◽  
4G Lte

SNOW 3G is a stream cipher designed in 2006 by ETSI/SAGE, serving in 3GPP as one of the standard algorithms for data confidentiality and integrity protection. It is also included in the 4G LTE standard. In this paper we derive vectorized linear approximations of the finite state machine in SNOW3G. In particular,we show one 24-bit approximation with a bias around 2−37 and one byte-oriented approximation with a bias around 2−40. We then use the approximations to launch attacks on SNOW 3G. The first approximation is used in a distinguishing attack resulting in an expected complexity of 2172 and the second one can be used in a standard fast correlation attack resulting in key recovery in an expected complexity of 2177. If the key length in SNOW 3G would be increased to 256 bits, the results show that there are then academic attacks on such a version faster than the exhaustive key search.

scholarly journals LIZARD – A Lightweight Stream Cipher for Power-constrained Devices

2017 ◽  
pp. 45-79 ◽  
Author(s):  
Matthias Hamann ◽  
Matthias Krause ◽  
Willi Meier
Keyword(s):  
Stream Cipher ◽  
Stream Ciphers ◽  
Rfid Tags ◽  
Security Level ◽  
Key Recovery ◽  
Passive Rfid ◽  
Key Recovery Attacks ◽  
Mode A ◽  
Hardware Efficiency ◽  
Constrained Devices

Time-memory-data (TMD) tradeoff attacks limit the security level of many classical stream ciphers (like E0, A5/1, Trivium, Grain) to 1/2n, where n denotes the inner state length of the underlying keystream generator. In this paper, we present Lizard, a lightweight stream cipher for power-constrained devices like passive RFID tags. Its hardware efficiency results from combining a Grain-like design with the FP(1)-mode, a recently suggested construction principle for the state initialization of stream ciphers, which offers provable 2/3n-security against TMD tradeoff attacks aiming at key recovery. Lizard uses 120-bit keys, 64-bit IVs and has an inner state length of 121 bit. It is supposed to provide 80-bit security against key recovery attacks. Lizard allows to generate up to 218 keystream bits per key/IV pair, which would be sufficient for many existing communication scenarios like Bluetooth, WLAN or HTTPS.

scholarly journals Catalog and Illustrative Examples of Lightweight Cryptographic Primitives

2021 ◽  
pp. 21-47
Author(s):  
Aleksandra Mileva ◽  
Vesna Dimitrova ◽  
Orhun Kara ◽  
Miodrag J. Mihaljević
Keyword(s):  
Stream Cipher ◽  
Block Cipher ◽  
Security Analysis ◽  
Stream Ciphers ◽  
Security Evaluation ◽  
Cryptographic Primitives ◽  
Internal States ◽  
Lightweight Block Cipher ◽  
Hardware Performance

AbstractThe main objective of this chapter is to offer to practitioners, researchers and all interested parties a brief categorized catalog of existing lightweight symmetric primitives with their main cryptographic features, ultimate hardware performance, and existing security analysis, so they can easily compare the ciphers or choose some of them according to their needs. Certain security evaluation issues have been addressed as well. In particular, the reason behind why modern lightweight block cipher designs have in the last decade overwhelmingly dominated stream cipher design is analyzed in terms of security against tradeoff attacks. It turns out that it is possible to design stream ciphers having much smaller internal states.

scholarly journals Atom: A Stream Cipher with Double Key Filter

2021 ◽  
pp. 5-36
Author(s):  
Subhadeep Banik ◽  
Andrea Caforio ◽  
Takanori Isobe ◽  
Fukang Liu ◽  
Willi Meier ◽  
...  
Keyword(s):  
Stream Cipher ◽  
Internal State ◽  
Common Knowledge ◽  
Basic Structure ◽  
Stream Ciphers ◽  
Security Level ◽  
Secret Key ◽  
Internal States ◽  
The Face

It has been common knowledge that for a stream cipher to be secure against generic TMD tradeoff attacks, the size of its internal state in bits needs to be at least twice the size of the length of its secret key. In FSE 2015, Armknecht and Mikhalev however proposed the stream cipher Sprout with a Grain-like architecture, whose internal state was equal in size with its secret key and yet resistant against TMD attacks. Although Sprout had other weaknesses, it germinated a sequence of stream cipher designs like Lizard and Plantlet with short internal states. Both these designs have had cryptanalytic results reported against them. In this paper, we propose the stream cipher Atom that has an internal state of 159 bits and offers a security of 128 bits. Atom uses two key filters simultaneously to thwart certain cryptanalytic attacks that have been recently reported against keystream generators. In addition, we found that our design is one of the smallest stream ciphers that offers this security level, and we prove in this paper that Atom resists all the attacks that have been proposed against stream ciphers so far in literature. On the face of it, Atom also builds on the basic structure of the Grain family of stream ciphers. However, we try to prove that by including the additional key filter in the architecture of Atom we can make it immune to all cryptanalytic advances proposed against stream ciphers in recent cryptographic literature.

scholarly journals Hardware optimizations of stream cipher rabbit

2011 ◽  
Vol 50 (1) ◽  
pp. 87-101
Author(s):  
Jozef Tomecek
Keyword(s):  
Stream Cipher ◽  
Stream Ciphers ◽  
Optimization Techniques ◽  
Cryptographic Primitives ◽  
Trade Offs ◽  
Algorithm Comparison ◽  
Form Part ◽  
Hardware Optimizations ◽  
Hardware Performance

ABSTRACT Stream ciphers form part of cryptographic primitives focused on privacy. Synchronous, symmetric and software-oriented stream cipher Rabbit is member of final portfolio of European Union's eStream project. Although it was designed to perform well in software, employed operations seem to compute effi­ciently in hardware. 128-bit security, with no known security weaknesses is claimed by Rabbit's designers. Since hardware performance of Rabbit was only estimated in the proposal of algorithm, comparison of direct and optimized FPGA im­plementations of Rabbit stream cipher is presented, identifying algorithm bot­tlenecks, discussing optimization techniques applied to algorithm computations, along with key area/time trade-offs.

scholarly journals On the Statistical Analysis of ZUC, Espresso and Grain v1

2021 ◽  
pp. 384-390
Author(s):  
Saurabh Shrivastava ◽  
K. V. Lakshmy ◽  
Chungath Srinivasan
Keyword(s):  
Statistical Analysis ◽  
Stream Cipher ◽  
Internal State ◽  
Statistical Tests ◽  
Stream Ciphers ◽  
Hamming Weight ◽  
Secret Key ◽  
State Correlation ◽  
Very High

A stream cipher generates long keystream to be XORed with plaintext to produce ciphertext. A stream cipher is said to be secure if the keystream that it produces is consistently random. One of the ways by which we can analyze stream ciphers is by testing randomness of the keystream. The statistical tests mainly try to find if any output keystream leaks any information about the secret key or the cipher’s internal state and also check the randomness of the keystream. We have applied these tests to different keystreams generated by ZUC, Espresso and Grain v1 stream ciphers to check for any weaknesses. We have also proposed four new statistical tests to analyze the internal state when the hamming weight of key and IV used is very high or low. Out of these four tests, Grain v1 fails the last test i.e. internal state correlation using high hamming weight IV.

Sign in / Sign up

Export Citation Format

Share Document