All Questions

30 views

How to calculate unicity distance of Fleissner grille?

I need to calculate unicity distance of Fleissners grille of $M \times M$ size. All I know is that plaint text redundancy equals $2$. The alphabet is not specified. Is it possible to calculate its ...
64 views

splitting the plaintext and ciphertext into blocks

Say I was to use RSA with a given value of n. I choose to split the plaintext and ciphertext written in a 27 letter alphabet into blocks with k and m characters resp. How would I find the largest ...
19 views

Uniformly distributed sub-sequences of a main PRG sequence

Let $g_s$ be a pseudo-random generator that generates uniform distributions of numbers ($s$ : seed) of a fixed bit-size. One wants to compare the pseudo-randomness of certain subsets of elements ...
17 views

$GF(2^n)$ for $n > 32$ arithmetics free or opensource java library [migrated]

I need a library implementing the $GF(2^n)$ field arithmetic for a large $n$. I tried BouncyCastle but it provides only $n < 32$.
54 views

Semaev summation polynomials

I am little confused how this attack works. We have the points $P, Q$ such that $Q = nP$. We let $u_{1}$and $u_{2}$ such that $R(x,y)=u_{1}P+u_{2}Q$. Then if we find the solution $x_1,...,x_n$ of the ...
74 views

Proof that this is not a secure pseudorandom function

$p$ is a large prime number. Consider the following function $F:\mathbb Z^*_p \times \mathbb D\rightarrow\mathbb Z^*_p$ where $\mathbb D=2,....,p-1$. $F_k(x)=x^k \bmod p$ Proof that it's ...
In one of my assignments I need to solve the below: For a Montgomery curve $3v^2 = u^3+u^2+u$ over ${\mathbb{F}}_{11}$ and point $P = (9,8)$. I need to compute $x$ coordinate of $3P$ using ...