Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleDecember 2023
Cryptographic Competitions
AbstractCompetitions are widely viewed as the safest way to select cryptographic algorithms. This paper surveys procedures that have been used in cryptographic competitions, and analyzes the extent to which those procedures reduce security risks.
- research-articleNovember 2019
SAT Solvers and their Limits with NFSR-based Stream Ciphers: an Example with Grain v1
CECC 2019: Proceedings of the Third Central European Cybersecurity ConferenceArticle No.: 19, Pages 1–5https://doi.org/10.1145/3360664.3360683Many modern stream ciphers combine linear and nonlinear operations with a certain amount of initial clock steps without producing keystream bits for encryption. As a result of this behaviour, the resulting system of equations get more and more complex ...
- research-articleJune 2016
RunStream: A High-Level Rapid Prototyping Framework for Stream Ciphers
- Ayesha Khalid,
- Goutam Paul,
- Anupam Chattopadhyay,
- Faezeh Abediostad,
- Syed Imad Ud Din,
- Muhammad Hassan,
- Baishik Biswas,
- Prasanna Ravi
ACM Transactions on Embedded Computing Systems (TECS), Volume 15, Issue 3Article No.: 61, Pages 1–27https://doi.org/10.1145/2891412We present RunStream, a rapid prototyping framework for realizing stream cipher implementations based on algorithmic specifications and architectural customizations desired by the users. In the dynamic world of cryptography where newer recommendations ...
- ArticleDecember 2014
One Word/Cycle HC-128 Accelerator via State-Splitting Optimization
AbstractAs today’s high performance embedded systems are heterogeneous platforms, a crisp boundary between the software and the hardware ciphers is fast getting murky. This work takes up the design of a dedicated hardware accelerator for HC-128, one of ...
- ArticleAugust 2014
Constructing Empirical Tests of Randomness
ICETE 2014: Proceedings of the 11th International Joint Conference on e-Business and Telecommunications - Volume 4Pages 229–237https://doi.org/10.5220/0005023902290237In this paper we introduce a general framework for automatic construction of empirical tests of randomness. Our new framework generalises and improves a previous approach (Å venda et al., 2013) and it also provides a clear statistical interpretation of ...
-
- ArticleNovember 2012
Optimized GPU implementation and performance analysis of HC series of stream ciphers
ICISC'12: Proceedings of the 15th international conference on Information Security and CryptologyPages 293–308https://doi.org/10.1007/978-3-642-37682-5_21The ease of programming offered by the CUDA programming model attracted a lot of programmers to try the platform for acceleration of many non-graphics applications. Cryptography, being no exception, also found its share of exploration efforts, ...
- ArticleNovember 2012
Impact of extending side channel attack on cipher variants: a case study with the HC series of stream ciphers
SPACE'12: Proceedings of the Second international conference on Security, Privacy, and Applied Cryptography EngineeringPages 32–44https://doi.org/10.1007/978-3-642-34416-9_3Side channel attacks are extremely implementation specific. An attack is tailor-made for a specific cipher algorithm implemented in a specific model. A natural question is: what is the effect of a side channel technique on a variant of the cipher ...
- ArticleNovember 2011
Latin dances revisited: new analytic results of Salsa20 and ChaCha
ICICS'11: Proceedings of the 13th international conference on Information and communications securityPages 255–266In this paper, we propose new attacks on 9-round Salsa20 and 8-round ChaCha. We constructed a distinguisher of double-bit differentials to improve Aumasson's single-bit differential cryptanalysis. We searched for correlations using a PC, and found ...
- ArticleNovember 2011
Latin Dances Revisited: New Analytic Results of Salsa20 and ChaCha
AbstractIn this paper, we propose new attacks on 9-round Salsa20 and 8-round ChaCha. We constructed a distinguisher of double-bit differentials to improve Aumasson’s single-bit differential cryptanalysis. We searched for correlations using a PC, and found ...
- ArticleNovember 2011
A theoretical analysis of the structure of HC-128
IWSEC'11: Proceedings of the 6th International conference on Advances in information and computer securityPages 161–177HC-128 is an eSTREAM finalist and no practical attack on this cipher is known. We show that the knowledge of any one of the two internal state arrays of HC-128 along with the knowledge of 2048 keystream words is sufficient to construct the other state ...
- articleApril 2011
Some observations on HC-128
Designs, Codes and Cryptography (DCAC), Volume 59, Issue 1-3Pages 231–245https://doi.org/10.1007/s10623-010-9459-8In this paper, we study HC-128 in detail from cryptanalytic point of view. First, we use linear approximation of the addition modulo 2 n of three n-bit integers to identify linear approximations of g ...
- ArticleOctober 2010
Improved distinguishing attack on rabbit
Rabbit is a stream cipher using a 128-bit key. It outputs one keystream block of 128 bits each time, which consists of eight sub-blocks of 16 bits. It is among the finalists of ECRYPT Stream Cipher Project (eSTREAM). Rabbit has also been published as ...
- ArticleJune 2010
Distinguishing Attack on Bivium
CIT '10: Proceedings of the 2010 10th IEEE International Conference on Computer and Information TechnologyPages 1075–1078https://doi.org/10.1109/CIT.2010.196Bivium is a simplified version of Trivium, a hardware profile finalist of eSTREAM project. Bivium has an internal state of size 177 bits and a key length of 80 bits. In this paper we introduce a distinguishing attack on this cipher. In this method we ...
- ArticleDecember 2009
Hardware framework for the rabbit stream cipher
Inscrypt'09: Proceedings of the 5th international conference on Information security and cryptologyPages 230–247Rabbit 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 ...
- ArticleAugust 2009
Guess and Determine Attack on SOSEMANUK
IAS '09: Proceedings of the 2009 Fifth International Conference on Information Assurance and Security - Volume 01Pages 658–661https://doi.org/10.1109/IAS.2009.165SOSEMANUK is a new synchronous software-oriented stream cipher with a variable-length key between 128 and 256 bits. In this paper, a Guess and Determine (GD) attack on the cipher is introduced with a computational complexity of 2^192 , requiring only 7 ...
- ArticleDecember 2008
Slid Pairs in Salsa20 and Trivium
INDOCRYPT '08: Proceedings of the 9th International Conference on Cryptology in India: Progress in CryptologyPages 1–14https://doi.org/10.1007/978-3-540-89754-5_1The stream ciphers Salsa20 and Trivium are two of the finalists of the eSTREAM project which are in the final portfolio of new promising stream ciphers. In this paper we show that initialization and key-stream generation of these ciphers is <em>slidable<...
- ArticleOctober 2008
Key Recovery Attack on Stream Cipher Mir-1 Using a Key-Dependent S-Box
AbstractMir-1 is a stream cipher proposed for Profile 1 at the ECRYPT Stream Cipher Project (eSTREAM). The Mir-1 designer claims a security level of at least 2128, meaning that the secret key cannot be recovered or that the Mir-1 output sequence cannot be ...
- ArticleJune 2008
Correlated keystreams in MOUSTIQUE
AFRICACRYPT'08: Proceedings of the Cryptology in Africa 1st international conference on Progress in cryptologyPages 246–257Moustique is one of the sixteen finalists in the eSTREAM stream cipher project. Unlike the other finalists it is a self-synchronising cipher and therefore offers very different functional properties, compared to the other candidates. We present simple ...
- ArticleJune 2008
Chosen IV statistical analysis for key recovery attacks on stream ciphers
AFRICACRYPT'08: Proceedings of the Cryptology in Africa 1st international conference on Progress in cryptologyPages 236–245A recent framework for chosen IV statistical distinguishing analysis of stream ciphers is exploited and formalized to provide new methods for key recovery attacks. As an application, a key recovery attack on simplified versions of two eSTREAM Phase 3 ...
- ArticleMay 2008
Attacking Bivium using SAT solvers
In this paper we present experimental results of an application of SAT solvers in current cryptography. Trivium is a very promising stream cipher candidate in the final phase of the eSTREAM project. We use the fastest industrial SAT solvers to attack a ...