You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output.
Click here to find out more.
Mendeley readers
Chapter title |
Non-linear Complexity of the Naor–Reingold Pseudo-random Function
|
---|---|
Chapter number | 5 |
Book title |
Information Security and Cryptology - ICISC’99
|
Published in |
Lecture notes in computer science, January 2000
|
DOI | 10.1007/10719994_5 |
Book ISBNs |
978-3-54-067380-4, 978-3-54-045568-4
|
Authors |
Banks, William D., Griffin, Frances, Lieman, Daniel, Shparlinski, Igor E., William D. Banks, Frances Griffin, Daniel Lieman, Igor E. Shparlinski |
Mendeley readers
The data shown below were compiled from readership statistics for 25 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
Unknown | 25 | 100% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Student > Ph. D. Student | 7 | 28% |
Researcher | 5 | 20% |
Student > Master | 4 | 16% |
Professor | 4 | 16% |
Other | 1 | 4% |
Other | 2 | 8% |
Unknown | 2 | 8% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 19 | 76% |
Mathematics | 2 | 8% |
Physics and Astronomy | 1 | 4% |
Unknown | 3 | 12% |