Mohammad Zeynali Azim

6 Questions 8 Answers 0 Followers

Questions related from Mohammad Zeynali Azim

NIST Randomness Test for Cryptography

we know that for randomness, algorithm must be pass some randomness test such as monobit, Serial and so on. if random number generation algorithm, pass many Test, but do not pass monobit Test....

01 January 1970 7,563 0 View

Random number Test

is bitmap representation pass all randomness Test Or not? I think that if bitmap representation of random number has not special pattern it will pass many important test. but question is, if we...

01 January 1970 7,171 0 View

Cryptography algorithm such az AES

we know that in AES algorithm, number of Rounds is constant for example 9 round. if the number of rounds is variable or dynamic, is it could increase strength of security and non-reversibility?

01 January 1970 1,184 16 View

RSA Cryptography Algorithm

Hi Dears, according to implementation RSA in python. I found that if p and q large. the decryption phase takes a lot of time to execute. for example, in this code i select p=23099, q=23059,...

01 January 1970 9,414 5 View

True random number generator

We know that for generating TRN almost we use hardware system and natural phenome. In PRN we use computer programs for generate random number. if we design, frequency of number, of this...

01 January 1970 8,896 6 View

Symmetric cryptography algorithm

We know that, according to cryptographic scientists, encryption is a powerful, when the minimum key length is equal to the length of the text. In my encryption algorithm, I want to use four keys,...

01 January 1970 8,059 0 View