New Distinguishers Based on Random Mappings against Stream Ciphers

Date

2008-09-18

Author

Turan, Meltem Sonmez
Calik, Cagdas
Saran, Nurdan Buz
Doğanaksoy, Ali

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

167
views

0
downloads

Statistical randomness testing plays an important role in security analysis of cryptosystems. In this study, we aim to propose a new framework of randomness testing based on random mappings. Considering the probability distributions of coverage and P-lengths, we present three new distinguishers; (i) coverage test, (ii) p-test and (iii) DP-coverage test and applied them on Phase III Candidates of eSTREAM project. We experimentally observed some statistical weaknesses of Po-maranch using the coverage test.

Subject Keywords

Random mappings, TMTO attacks, Randomness tests, Stream ciphers

URI

https://hdl.handle.net/11511/54825

Collections

Department of Mathematics, Conference / Seminar

Suggestions

OpenMETU
Core

Alternative Approach to Maurer's Universal Statistical Test Tezcan, Cihangir; Doğanaksoy, Ali (null; 2008-12-01) Statistical tests for randomness play an important role in cryptography since many cryptographic applications require random or pseudorandom numbers. In this study, we introduce an alternative approach to Maurer’s Universal Test. This approach allows us to test short binary sequences as small as 66 bits and to choose slightly larger block sizes. Moreover, it does not have an initialization part and requires less time to test a binary sequence.
New change detection method using double segmentation and its application on remotely sensed images Gedik, Ekin; Yarman Vural, Fatoş Tunay; Department of Computer Engineering (2013) Change detection research, a branch of statistical data analysis, focuses on detecting changed samples between di erent observations of the same dataset. The proposed study presents a novel change detection procedure and its application as a complete framework which is designed to work on remotely sensed images. The scope of the study is defined as detecting man-made change objects between satellite images of the same region, acquired at di erent times. Proposed framework has three main steps as preprocessi...
On Independence and Sensitivity of Statistical Randomness Tests Turan, Meltem Soenmez; Doğanaksoy, Ali; Boztas, Serdar (2008-09-18) Statistical randomness testing has significant importance in analyzing the quality of random number generators. In this study, we focus on the independence of randomness tests and its effect on the coverage of test suites. We experimentally observe that frequency, overlapping template, longest run of ones, random walk height and maximum order complexity tests are correlated for short sequences. We also proposed the concept of sensitivity, where we analyze the effect of simple transformations on output p-val...
A multicriteria sorting approach based on data envelopment analysis for R&D project selection problem Karasakal, Esra (Elsevier BV, 2017-12-01) In this paper, multiple criteria sorting methods based on data envelopment analysis (DEA) are developed to evaluate research and development (R&D) projects. The weight intervals of the criteria are obtained from Interval Analytic Hierarchy Process and employed as the assurance region constraints of models. Based on data envelopment analysis, two threshold estimation models, and five assignment models are developed for sorting. In addition to sorting, these models also provide ranking of the projects. The de...
New transitive closure algorithm for recursive query processing in deductive databases Toroslu, İsmail Hakkı (1992-01-01) © 1992 IEEE.The development of effic1.e11t algorithms to process the different forms of the transitive-closure (TC) queries within the context of large database systems has recently attracted a large amom1t of research efforts. In this paper, we present a neic algorithm suitable for full transitive closure problem, which zs used to solve uninstentiated recursive qi1enes in deductive databases. In this new algorithm there are two phases. In the first phase a general graph is condensed into an acyclic graph a...

Citation Formats

M. S. Turan, C. Calik, N. B. Saran, and A. Doğanaksoy, “New Distinguishers Based on Random Mappings against Stream Ciphers,” 2008, vol. 5203, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/54825.