Attack Algorithm for a Keystore-Based Secret Key Generation Method

. 2019 Feb 23;21(2):212. doi: 10.3390/e21020212

Algorithm 1 Successful attack probability with R keys

Input: Variables $L, l, R, t$
Output: True if the indicator matrix rank is larger than or equal toL
fori from 1 to Rdo

k e y_i n d e x_s e t \leftarrow

Randomly select t integers in range of (0,

L - 1

)

{e_{i}}^{0} \leftarrow

indicator vector of

k e y_i n d e x_s e t

of length l
for j from 1 to $l - 1$ do

{e_{i}}^{j} \leftarrow

circular cyclic shift right once of

{e_{i}}^{j - 1}

end for

M_{i} \leftarrow s t a c k {{e_{i}}^{0}, \dots, {e_{i}}^{l - 1}}

M = s t a c k {M_{1}, \dots, M_{i}}

if rank

(M) \geq L

then
return True
end if
end for