scholarly journals Mối liên hệ giữa tính nhận biết tiền ảnh và một số tính chất mật mã khác của hàm băm

2021 ◽  
Vol 1 (13) ◽  
pp. 12-20
Author(s):  
Nguyễn Tuấn Anh ◽  
Triệu Quang Phong
Keyword(s):  
Template Matching ◽  
Test Suite ◽  
Minimum Length ◽  
Number Generator ◽  
Matching Test ◽  
Randomness Tests

Tóm tắt—Các kiểm tra liên quan đến so khớp mẫu chồng lấp đã được đề xuất trong NIST SP 800-22 [1], tuy nhiên các xác suất trong các kiểm tra này chỉ đúng cho các mẫu đặc biệt và cần được tính lại cho các mẫu khác. Trong [2], các tác giả đã đề xuất các tiêu chuẩn thống kê so khớp mẫu mới cho tất cả các mẫu 4 bit. Các kiểm tra mới này áp dụng cho chuỗi bất kỳ có độ dài tối thiểu là 5504 bit, trong khi theo NIST độ dài tối thiểu 106 bit. Trong bài báo này, chúng tôi đã cải tiến và đề xuất các kiểm tra so khớp mẫu 4 bit mới mà có thể áp dụng cho các chuỗi bất kỳ có độ dài nhỏ nhất chỉ là 3726 bit. Hơn nữa, chúng tôi đưa ra 3 kiểm tra thống kê so khớp mẫu 5 bit mới. Kết quả lý thuyết và thực hành cho thấy các đề xuất cải tiến của chúng tôi là rất hiệu quả trong việc đánh giá tính ngẫu nhiên cho các bộ tạo số giả ngẫu nhiên. Abstract—Randomness tests related to overlapping template matching have been proposed in NIST SP 800-22 [1], however the probabilities in these tests are only valid for specific samples and should be recalculated for other samples. In [2], the authors proposed new template matching tests for all 4-bit templates. The new tests can be applied to any sequence of minimum length of 5504 bits whereas the overlapping template matching test in the NIST test suite can only be applied to sequences of minimum length of 106 bits. In this paper, we have modified and proposed new 4-bit template matching tests that can be applied to any sequence of minimum length 3726 bits. Furthermore, we proposed three new 5-bit template matching tests. Our theoretical and practical results show that our new proposed tests are very efficient in psedorandom number generator testing.

scholarly journals Một số cải tiến cho các kiểm tra thống kê tính ngẫu nhiên sử dụng so khớp mẫu

2021 ◽  
Vol 1 (13) ◽  
pp. 49-61
Author(s):  
Hoang Dinh Linh ◽  
Trần Thị Lượng
Keyword(s):  
Template Matching ◽  
Test Suite ◽  
Minimum Length ◽  
Number Generator ◽  
Matching Test ◽  
Randomness Tests

Tóm tắt—Các kiểm tra liên quan đến so khớp mẫu chồng lấp đã được đề xuất trong NIST SP 800-22 [1], tuy nhiên các xác suất trong các kiểm tra này chỉ đúng cho các mẫu đặc biệt và cần được tính lại cho các mẫu khác. Trong [2], các tác giả đã đề xuất các tiêu chuẩn thống kê so khớp mẫu mới cho tất cả các mẫu 4 bit. Các kiểm tra mới này áp dụng cho chuỗi bất kỳ có độ dài tối thiểu là 5504 bit, trong khi theo NIST độ dài tối thiểu 106 bit. Trong bài báo này, chúng tôi đã cải tiến và đề xuất các kiểm tra so khớp mẫu 4 bit mới mà có thể áp dụng cho các chuỗi bất kỳ có độ dài nhỏ nhất chỉ là 3726 bit. Hơn nữa, chúng tôi đưa ra 3 kiểm tra thống kê so khớp mẫu 5 bit mới. Kết quả lý thuyết và thực hành cho thấy các đề xuất cải tiến của chúng tôi là rất hiệu quả trong việc đánh giá tính ngẫu nhiên cho các bộ tạo số giả ngẫu nhiên. Abstract—Randomness tests related to overlapping template matching have been proposed in NIST SP 800-22 [1], however the probabilities in these tests are only valid for specific samples and should be recalculated for other samples. In [2], the authors proposed new template matching tests for all 4-bit templates. The new tests can be applied to any sequence of minimum length of 5504 bits whereas the overlapping template matching test in the NIST test suite can only be applied to sequences of minimum length of 106 bits. In this paper, we have modified and proposed new 4-bit template matching tests that can be applied to any sequence of minimum length 3726 bits. Furthermore, we proposed three new 5-bit template matching tests. Our theoretical and practical results show that our new proposed tests are very efficient in psedorandom number generator testing.

scholarly journals Magniber v2 Ransomware Decryption: Exploiting the Vulnerability of a Self-Developed Pseudo Random Number Generator

Electronics ◽  
2020 ◽  
Vol 10 (1) ◽  
pp. 16
Author(s):  
Sehoon Lee ◽  
Myungseo Park ◽  
Jongsung Kim
Keyword(s):  
Random Number ◽  
Random Number Generator ◽  
Number Generator ◽  
Pseudo Random Number ◽  
Operation Process ◽  
User Data ◽  
Encryption Algorithms ◽  
Recovery Result ◽  
Pseudo Random Number Generator ◽  
Randomness Tests

With the rapid increase in computer storage capabilities, user data has become increasingly important. Although user data can be maintained by various protection techniques, its safety has been threatened by the advent of ransomware, defined as malware that encrypts user data, such as documents, photographs and videos, and demands money to victims in exchange for data recovery. Ransomware-infected files can be recovered only by obtaining the encryption key used to encrypt the files. However, the encryption key is derived using a Pseudo Random Number Generator (PRNG) and is recoverable only by the attacker. For this reason, the encryption keys of malware are known to be difficult to obtain. In this paper, we analyzed Magniber v2, which has exerted a large impact in the Asian region. We revealed the operation process of Magniber v2 including PRNG and file encryption algorithms. In our analysis, we found a vulnerability in the PRNG of Magniber v2 developed by the attacker. We exploited this vulnerability to successfully recover the encryption keys, which was by verified the result in padding verification and statistical randomness tests. To our knowledge, we report the first recovery result of Magniber v2-infected files.

scholarly journals On the independence of statistical randomness tests included in the NIST test suite

2017 ◽  
Vol 25 ◽  
pp. 3673-3683 ◽  
Author(s):  
Fatih SULAK ◽  
Muhiddin UĞUZ ◽  
Onur KOÇAK ◽  
Ali DOĞANAKSOY
Keyword(s):  
Test Suite ◽  
Randomness Tests

scholarly journals Using Poly-Dragon Cryptosystem in a Pseudorandom Number Generator Mstg

2014 ◽  
Vol 61 (1) ◽  
pp. 105-116
Author(s):  
Viliam Hromada ◽  
Milan Vojvoda
Keyword(s):  
Finite Groups ◽  
Statistical Test ◽  
Statistical Properties ◽  
Public Key ◽  
Test Suite ◽  
Pseudorandom Number ◽  
Pseudorandom Number Generator ◽  
Public Key Cryptosystem ◽  
Number Generator

Abstract This paper deals with a new pseudorandom number generator MSTg proposed in 2010. Its construction is based on random covers for finite groups. We have used a public-key cryptosystem Poly-Dragon to generate these random covers and have studied the statistical properties of the resulting pseudorandom number generator by testing its output using the NIST Statistical Test Suite

Some Polynomial Chaotic Maps Without Equilibria and an Application to Image Encryption with Avalanche Effects

2015 ◽  
Vol 25 (09) ◽  
pp. 1550124 ◽  
Author(s):  
Lequan Min ◽  
Xiuping Yang ◽  
Guanrong Chen ◽  
Danling Wang
Keyword(s):  
Numerical Simulation ◽  
Image Encryption ◽  
Chaos Synchronization ◽  
Chaotic Dynamics ◽  
Chaotic Maps ◽  
Test Suite ◽  
Pseudorandom Number Generator ◽  
Encryption Scheme ◽  
Number Generator ◽  
Key Space

This study uses seven four-dimensional four-variable polynomial chaotic maps without equilibria in combination with generalized chaos synchronization (GCS) theorem to construct eight-dimensional bidirectional discrete generalized chaos synchronization (8DBDGCS) systems without equilibria. By combining the 8DBDGCS system with the GCS theorem, a 12-dimensional GCS system is designed. Numerical simulation verifies the chaotic dynamics of the 12-dimensional GCS system, which is used to design a 216-word chaotic pseudorandom number generator (CPRNG). The SP-8002 test suite is used to test the randomness of four 100-key streams consisting of 1 000 000 bits generated respectively by the CPRNG, a six-dimensional GCS-based CPRNG, the RC4 algorithm and the ZUC algorithm. The results show that the randomness performances of the two CPRNGs are promising, suggesting that there are no significant correlations between the key stream and the perturbed key streams generated via the 216-word CPRNG. In addition, theoretically the key space of the CPRNG is larger than 21195. The CPRNG is used with an avalanche-encryption scheme to encrypt an RGB balloon image, demonstrating that the CPRNG is able to generate the avalanche effects which are similar to those generated via ideal 216-word CPRNGs.

Templates selection in non‐overlapping template matching test

2016 ◽  
Vol 52 (18) ◽  
pp. 1533-1535 ◽  
Author(s):  
Meihui Chen ◽  
Hua Chen ◽  
Limin Fan ◽  
Dengguo Feng
Keyword(s):  
Template Matching ◽  
Matching Test

scholarly journals Demonstration of Three True Random Number Generator Circuits Using Memristor Created Entropy and Commercial Off-the-Shelf Components

Entropy ◽  
2021 ◽  
Vol 23 (3) ◽  
pp. 371
Author(s):  
Scott Stoller ◽  
Kristy A. Campbell
Keyword(s):  
Random Number ◽  
Random Number Generator ◽  
Statistical Test ◽  
Test Suite ◽  
Successful Implementation ◽  
Number Generator ◽  
Simple Circuit ◽  
True Random Number Generator ◽  
Commercial Off The Shelf ◽  
Circuit Components

In this work, we build and test three memristor-based true random number generator (TRNG) circuits: two previously presented in the literature and one which is our own design. The functionality of each circuit is assessed using the National Institute of Standards and Technology (NIST) Statistical Test Suite (STS). The TRNG circuits were built using commercially available off-the-shelf parts, including the memristor. The results of this work confirm the usefulness of memristors for successful implementation of TRNG circuits, as well as the ease with which a TRNG can be built using simple circuit designs and off-the-shelf breadboard circuit components.

Sign in / Sign up

Export Citation Format

Share Document