New answers tagged

3

I'm going to treat this question as a strict one time pad one. With a key k of sufficient length, say 128 bits, is it possible to use kth multiple of π as a one-time pad? That's 107 characters of description plus 128 bits of secrecy (plus $\pi$ which is a known constant). Your Kolmogorov complexity cannot exceed 200 characters if you consider that:- $$\pi =...


4

That is not practical since either you keep a sequence of the bits of the $\pi$ or regenerate them every time. You may need to store 64GB sequence if you want to encrypt such files. Then you need to multiply it with the 128-bit number. That is not practical, consider multiplication of 64GB number with a random 128-bit number. OTP needs true random bit ...


2

In this case because the trail $E_1$ begins at the stage in the cipher directly after the trail $E_0$ ends you can use $E_m$ as the identity map which preserves all differences with probability one. Thus to generate data to exploit the distinguisher, start with an arbitrary plaintext, say 0x0123 and call the chosen plaintext resource for both this and its ...


0

This Example Is Using The Built-In PasswordDeriveBytes Function Aes Alg = Aes.Create(); byte[] IV = {0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15}; byte[] Salt = Encoding.ASCII.getBytes("Example Salt); string Password = "Example"; PasswordDeriveBytes pdb = new PasswordDeriveBytes(Password,salt); Aes.Key = pdb.CryptDeriveKey(&...


3

As explained in the answer to the question here the branch number of a linear mapping $$ A:F_q^n \rightarrow F_q^n, \quad x\mapsto A\cdot x $$ is the minimum weight of the linear code generated by the matrix $$ G=[~I~|~A]. $$ For an arbitrary matrix $A$ this problem is NP hard, i.e., very hard. For structured matrices like the MDS matrix in AES the answer is ...


1

The short answer is that we don't. There are several block ciphers (most famously PRESENT) where multiple linear trails combine to form a stronger distinguisher. The collection of trails is called a linear hull. The concept has been extended to differential-linear cryptanalysis, but I don't have any reference for a "difference hull". These multiple ...


1

The NIST special publication 800-90B is probably your go to here. It is the approach used to meet the FIPS 140-3 requirements which are accepted by as good assurance by a large population. Different approaches are taken for TRNGs that are believed to produce independent, identically distributed outputs and others. One of the key measurements is the minimum ...


Top 50 recent answers are included