@inproceedings{266e0805478d4ff2aa2aace398e1a082,

title = "Pseudorandom graphs from elliptic curves",

abstract = "Most of the constructions of pseudorandom graphs are based on additive or multiplicative groups of elements of finite fields. As a result the number of vertices of such graphs is limited to values of prime powers or some simple polynomial expressions involving prime powers. We show that elliptic curves over finite fields lead to new constructions of pseudorandom graphs with a new series of parameters. Accordingly, the number of vertices of such graphs can take most of positive integer values (in fact, any positive value under some classical conjectures about the gaps between prime numbers).",

author = "Shparlinski, {Igor E.}",

year = "2008",

doi = "10.1007/978-3-540-78773-0_25",

language = "English",

isbn = "3540787720",

volume = "4957 LNCS",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer, Springer Nature",

pages = "284--292",

editor = "Laber, {Eduardo Sany} and Claudson Bornstein and Nogueira, {Loana Tito} and Luerbio Faria",

booktitle = "LATIN 2008: Theoretical Informatics - 8th Latin American Symposium, Proceedings",

address = "United States",

note = "8th Latin American TheoreticalINformatics Symposium, LATIN 2008 ; Conference date: 07-04-2008 Through 11-04-2008",

}