Recurrence test for an encryption algorithm

5 ビュー (過去 30 日間)
YAHYA AL-MOLIKI
YAHYA AL-MOLIKI 2020 年 12 月 1 日
コメント済み: Walter Roberson 2020 年 12 月 2 日
The recurrence test is used to measure the randomness and to estimate the correlation among the data by consideing the variation between the received encrypted bytes S(t) and the delay version of it for t >=1 (S(t+1)).
How can we implemnet it uisng Matlab?
  4 件のコメント
Rik
Rik 2020 年 12 月 1 日
I partly agree with you. You can even use a truly aweful hashing algorithm (like e.g. mine) as an encryptions algorithm, but the main point is still that you will have to figure out a way to shift the signal, and the most optimal way to do that probably depends on what data type the implementation will accept.
Walter Roberson
Walter Roberson 2020 年 12 月 2 日
The question specifically talks about received encrypted bytes. As it seems unlikely that the person asking the question is a relic of the 1970s and early 1980s when "byte" had not yet been standardized as being the same as octet, we can be nearly certain that the datatype that will be returned will be uint8 (or double being used to represent uint8)
The question as phrased does not require any calls to the encryption algorithm, just analysis of a sequence of bytes. The question is not phrased as being an effort to find some input sequence that has an unusual correlation of bytes in output -- after all, if it is a "good" encryption algorithm, every possible sequence of output bytes is possible, including just happening to produce all 0 or all 42 or producing 0:255 in sequence.

サインインしてコメントする。

回答 (0 件)

カテゴリ

Help Center および File ExchangeEncryption / Cryptography についてさらに検索

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Translated by