Scholarlink

The objective of this paper is to analyze and compare the cryptographic performance of several Pseudorandom Binary Generators based on combinatorial functions. The study includes the Rueppel, Geffe, and Threshold generators, which use Linear Feedback Shift Registers (LFSRs). Five LFSRs with a prime number of registers were selected and grouped in combinations of three to ensure non-repetition. These groups were then used to generate pseudorandom sequences using the aforementioned generators. Finally, we performed randomization tests to evaluate the cryptographic behavior of each generator.

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Comparison of Some Pseudorandom Binary Generators Based on Combinatorial Functions

  • 会议论文

  • 发表日期：

    2025年

查看全文
  • Narayan Debnath,
  • Andrés Francisco Farías,
  • Andrés Alejandro Farías,
  • Ana Gabriela Garis,
  • Daniel Riesco,
  • Germán Antonio Montejano

摘要

The objective of this paper is to analyze and compare the cryptographic performance of several Pseudorandom Binary Generators based on combinatorial functions. The study includes the Rueppel, Geffe, and Threshold generators, which use Linear Feedback Shift Registers (LFSRs). Five LFSRs with a prime number of registers were selected and grouped in combinations of three to ensure non-repetition. These groups were then used to generate pseudorandom sequences using the aforementioned generators. Finally, we performed randomization tests to evaluate the cryptographic behavior of each generator.