6213 Белов М.А. Лаб.2 Вар.2 #273
Open
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
github-actions
bot
added
In progress
Daria-creator-lab
approved these changes
Sep 26, 2025
Daria-creator-lab
added
Approved
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
2 participants
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
В данной работе я с помощью ГПСЧ на языках java и C++ создал две 128-битные последовательности и дальше на языке Python я написал программу которая проводит три теста NIST над этими последовательностями:
Тест на самую длинную последовательность единиц в блоке
Тест на одинаковые подряд идущие биты
Частотный побитовый тест
Все эти тесты оказались больше уровня значимости 0.01, соответственно мы можем считать правдивой теорию о том что эти последовательности случайны.