Title of article :
Linear complexity of the Naor–Reingold pseudo-random function
Author/Authors :
Igor E. Shparlinski، نويسنده ,
Issue Information :
دوهفته نامه با شماره پیاپی سال 2000
Pages :
5
From page :
95
To page :
99
Keywords :
Naor–Reingold pseudo-random function , Linear complexity , cryptography
Journal title :
Information Processing Letters
Serial Year :
2000
Journal title :
Information Processing Letters
Record number :
129292
Link To Document :
https://search.isc.ac/dl/search/defaultta.aspx?DTC=10&DC=129292
بازگشت