Deterministic Computation of Pseudorandomness in Sequences of Cryptographic Application

被引：0
|
作者：
Fuster-Sabater, A. [1 ]
Caballero-Gil, P. [2 ]
Delgado-Mohatar, O. [1 ]
机构：
[1] CSIC, Inst Appl Phys, Serrano 144, Madrid 28006, Spain
[2] Univ La Laguna, Fac Math, DEIOC, E-38271 Tenerife, Spain
来源：
COMPUTATIONAL SCIENCE - ICCS 2009, PART I | 2009年 / 5544卷
关键词：
Pseudorandomness; bit-string; balancedness; run dirtribution; cryptography; LARGE LINEAR SPAN; GENERATORS;
D O I：
暂无
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
An easy method of checking balancedness degree as well as run quantification in sequences obtained from LFSR-based keystream generators has been developed. The procedure is a deterministic alternative to the traditional application of statistical tests. The computation method allows one to check deviation of balancedness and run distribution goodness from standard values. The method here developed can be considered as a first selective criterium for acceptance/rejection of this type of generators of cryptographic application.
引用
收藏
页码：621 / +
页数：2
相关论文
共 50 条
  • [21] On the Use of Linear Cellular Automata for the Synthesis of Cryptographic Sequences
    Fuster-Sabater, A.
    Caballero-Gil, P.
    Delgado, O.
    HYBRID ARTIFICIAL INTELLIGENCE SYSTEMS, 2008, 5271 : 475 - +
  • [22] Linear Solutions for Irregularly Decimated Generators of Cryptographic Sequences
    Fuster-Sabater, A.
    INTERNATIONAL JOURNAL OF NONLINEAR SCIENCES AND NUMERICAL SIMULATION, 2014, 15 (06) : 377 - 385
  • [23] A cryptographic application of the Thurston norm
    Flores, Ramon
    Kahrobaei, Delaram
    Koberda, Thomas
    INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS- COMPUTER SYSTEMS THEORY, 2020, 5 (01) : 15 - 24
  • [24] Generation of Pseudorandom Binary Sequences with Controllable Cryptographic Parameters
    Fuster-Sabater, Amparo
    COMPUTATIONAL SCIENCE AND ITS APPLICATIONS - ICCSA 2011, PT I, 2011, 6782 : 563 - 572
  • [25] Application of Laplace Transform For Cryptographic Scheme
    Hiwarekar, A. P.
    WORLD CONGRESS ON ENGINEERING - WCE 2013, VOL I, 2013, : 95 - 100
  • [26] Synthesis of cryptographic interleaved sequences by means of linear cellular automata
    Fuster-Sabater, Amparo
    Caballero-Gil, P.
    APPLIED MATHEMATICS LETTERS, 2009, 22 (10) : 1518 - 1524
  • [27] Chaotic Cellular Automata with Cryptographic Application
    Fuster-Sabater, Amparo
    Caballero-Gil, Pino
    CELLULAR AUTOMATA, 2010, 6350 : 251 - +
  • [28] Parallel-external computation of the cycle structure of invertible cryptographic functions
    Beckmann, Andreas
    Keller, Jorg
    15TH EUROMICRO INTERNATIONAL CONFERENCE ON PARALLEL, DISTRIBUTED AND NETWORK-BASED PROCESSING, PROCEEDINGS, 2007, : 526 - +
  • [29] Efficient computation of full Lucas sequences
    Joye, M
    Quisquater, JJ
    ELECTRONICS LETTERS, 1996, 32 (06) : 537 - 538
  • [30] Cryptographic pseudo-random sequences from the chaotic Henon map
    Suneel, Madhekar
    SADHANA-ACADEMY PROCEEDINGS IN ENGINEERING SCIENCES, 2009, 34 (05): : 689 - 701
12345