Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Reza Rezaeian Farashahi
2010 – today
- 2013
[j7]Reza Rezaeian Farashahi, Pierre-Alain Fouque, Igor Shparlinski, Mehdi Tibouchi, José Felipe Voloch: Indifferentiable deterministic hashing to elliptic and hyperelliptic curves. Math. Comput. 82(281) (2013)- 2012
[j6]Reza Rezaeian Farashahi, Igor E. Shparlinski: On Group Structures Realized by Elliptic Curves over a Fixed Finite Field. Experimental Mathematics 21(1): 1-10 (2012)
[j5]Reza Rezaeian Farashahi, Dustin Moody, Hongfeng Wu: Isomorphism classes of Edwards curves over finite fields. Finite Fields and Their Applications 18(3): 597-612 (2012)
[j4]Reza Rezaeian Farashahi, Igor Shparlinski: Pseudorandom Bits From Points on Elliptic Curves. IEEE Transactions on Information Theory 58(2): 1242-1247 (2012)
[c8]Reza Rezaeian Farashahi, Hongfeng Wu, Changan Zhao: Efficient Arithmetic on Elliptic Curves over Fields of Characteristic Three. Selected Areas in Cryptography 2012: 135-148
[i8]Reza Rezaeian Farashahi, Hongfeng Wu, Changan Zhao: Efficient Arithmetic on Hessian Curves over Fields of Characteristic Three. IACR Cryptology ePrint Archive 2012: 122 (2012)- 2011
[c7]
[i7]Reza Rezaeian Farashahi, Dustin Moody, Hongfeng Wu: Isomorphism classes of Edwards curves over finite fields. IACR Cryptology ePrint Archive 2011: 206 (2011)- 2010
[j3]Reza Rezaeian Farashahi, Igor Shparlinski: On the number of distinct elliptic curves in some families. Des. Codes Cryptography 54(1): 83-99 (2010)
[c6]Reza Rezaeian Farashahi, Marc Joye: Efficient Arithmetic on Hessian Curves. Public Key Cryptography 2010: 243-260
[i6]Reza Rezaeian Farashahi, Igor Shparlinski: Pseudorandom Bits From Points on Elliptic Curves. CoRR abs/1005.4771 (2010)
[i5]Reza Rezaeian Farashahi: Hashing into Hessian Curves. IACR Cryptology ePrint Archive 2010: 373 (2010)
[i4]Reza Rezaeian Farashahi, Pierre-Alain Fouque, Igor Shparlinski, Mehdi Tibouchi, José Felipe Voloch: Indifferentiable Deterministic Hashing to Elliptic and Hyperelliptic Curves. IACR Cryptology ePrint Archive 2010: 539 (2010)
2000 – 2009
- 2009
[j2]Reza Rezaeian Farashahi, Igor E. Shparlinski, José Felipe Voloch: On hashing into elliptic curves. J. Mathematical Cryptology 3(4): 353-360 (2009)- 2008
[j1]Reza Rezaeian Farashahi, Ruud Pellikaan, Andrey Sidorenko: Extractors for binary elliptic curves. Des. Codes Cryptography 49(1-3): 171-186 (2008)
[c5]Reza Rezaeian Farashahi: Extractors for Jacobians of Binary Genus-2 Hyperelliptic Curves. ACISP 2008: 447-462
[c4]Daniel J. Bernstein, Tanja Lange, Reza Rezaeian Farashahi: Binary Edwards Curves. CHES 2008: 244-265
[i3]Daniel J. Bernstein, Tanja Lange, Reza Rezaeian Farashahi: Binary Edwards Curves. IACR Cryptology ePrint Archive 2008: 171 (2008)
[i2]Wouter Castryck, Steven D. Galbraith, Reza Rezaeian Farashahi: Efficient arithmetic on elliptic curves using a mixed Edwards-Montgomery representation. IACR Cryptology ePrint Archive 2008: 218 (2008)- 2007
[c3]Reza Rezaeian Farashahi: Extractors for Jacobian of Hyperelliptic Curves of Genus 2 in Odd Characteristic. IMA Int. Conf. 2007: 313-335
[c2]Reza Rezaeian Farashahi, Berry Schoenmakers, Andrey Sidorenko: Efficient Pseudorandom Generators Based on the DDH Assumption. Public Key Cryptography 2007: 426-441
[c1]Reza Rezaeian Farashahi, Ruud Pellikaan: The Quadratic Extension Extractor for (Hyper)Elliptic Curves in Odd Characteristic. WAIFI 2007: 219-236- 2006
[i1]Reza Rezaeian Farashahi, Berry Schoenmakers, Andrey Sidorenko: Efficient Pseudorandom Generators Based on the DDH Assumption. IACR Cryptology ePrint Archive 2006: 321 (2006)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-05-15 21:56 CEST by the dblp team



