Advances in Cryptology
G. R. Blakely
- 01 juli 1985
- 9783540156581
Samenvatting:
In this paper we state a simple condition, the XOR-Condition and show that any generator satisfying this condition can output logn bits on each multiplication. We show that the XOR-Condition is satisfied by the lop least significant bits of the z2-mod N generator. The security of the z2 mod N generator was based on Quadratic Residu- ity [3].
€ 47,99
Bestel bij Bol.com >