Security assumptions Sample Clauses

Security assumptions. It was noticed in [1] that if the conjugator z generated randomly by the TTP algorithm is known, then there exists an efficient linear attack on the scheme which is able to recover the shared key of the parties. The problem of recovering the exact z seems like a very difficult mathematical problem because it reduces to solving the system of equations   w′ = ∆2p1 zw1z−1  w′  . . . γ = ∆2pγ zwγ z−1 (1)  v′ = ∆2r1 zv1z−1  v′  . . . γ = ∆2rγ zvγ z−1 which has too many unknowns, since only left hand sides (i.e., elements w′ , . . . , w′ , 1 γ v′ , . . . , v′ ) are known. Hence, it might be difficult to find the original z.

Security assumptions. The assumptions below do not reflect limitations of the system. These are reasonable basis of estimates used to contain the implementation effort within planned cost and schedule boundaries.