Linear complexity of the Naor-Reingold pseudo-random function
From MaRDI portal
Publication:294859
DOI10.1016/S0020-0190(00)00133-2zbMATH Open1339.94065MaRDI QIDQ294859FDOQ294859
Authors: Igor E. Shparlinski 
Publication date: 16 June 2016
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019000001332?np=y
Recommendations
- scientific article; zbMATH DE number 2048529
- scientific article; zbMATH DE number 1424198
- On the Multidimensional Distribution of the Naor–Reingold Pseudo-Random Function
- On the linear complexity of the Naor-Reingold sequence
- On the linear complexity of the Naor-Reingold pseudo-random function from elliptic curves.
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Linear complexity profiles: Hausdorff dimensions for almost perfect profiles and measures for general profiles
- On the Naor-Reingold pseudo-random function from elliptic curves
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the uniformity of distribution of the Naor-Reingold pseudo-random function
Cited In (7)
- On the linear complexity of the Naor-Reingold sequence with elliptic curves
- Polynomial interpolation of the generalized Diffie-Hellman and Naor-Reingold functions
- Title not available (Why is that?)
- On the uniformity of distribution of the Naor-Reingold pseudo-random function
- Polynomial interpolation of the Naor-Reingold pseudo-random function
- On the linear complexity of the Naor-Reingold sequence
- On the Multidimensional Distribution of the Naor–Reingold Pseudo-Random Function
This page was built for publication: Linear complexity of the Naor-Reingold pseudo-random function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q294859)
