Binary edwards curves DJ Bernstein, T Lange, RR Farashahi International Workshop on Cryptographic Hardware and Embedded Systems, 244-265, 2008 | 167 | 2008 |

Efficient arithmetic on Hessian curves RR Farashahi, M Joye International Workshop on Public Key Cryptography, 243-260, 2010 | 86 | 2010 |

Efficient pseudorandom generators based on the DDH assumption RR Farashahi, B Schoenmakers, A Sidorenko International Workshop on Public Key Cryptography, 426-441, 2007 | 75* | 2007 |

Indifferentiable deterministic hashing to elliptic and hyperelliptic curves RR Farashahi, PA Fouque, I Shparlinski, M Tibouchi, J Voloch Mathematics of Computation 82 (281), 491-512, 2013 | 61 | 2013 |

FPGA based fast and high-throughput 2-slow retiming 128-bit AES encryption algorithm RR Farashahi, B Rashidi, SM Sayedi Microelectronics journal 45 (8), 1014-1025, 2014 | 48 | 2014 |

Efficient pseudorandom generators based on the DDH assumption RR Farashahi, B Schoenmakers, A Sidorenko International Workshop on Public Key Cryptography, 426-441, 2007 | 44 | 2007 |

Hashing into Hessian curves RR Farashahi International Conference on Cryptology in Africa, 278-289, 2011 | 40 | 2011 |

Efficient arithmetic on elliptic curves using a mixed Edwards-Montgomery representation. W Castryck, SD Galbraith, RR Farashahi IACR Cryptol. ePrint Arch. 2008, 218, 2008 | 38 | 2008 |

High-speed hardware architecture of scalar multiplication for binary elliptic curve cryptosystems B Rashidi, SM Sayedi, RR Farashahi Microelectronics journal 52, 49-65, 2016 | 33 | 2016 |

On hashing into elliptic curves RR Farashahi, IE Shparlinski, JF Voloch Journal of Mathematical Cryptology 3 (4), 353-360, 2009 | 32 | 2009 |

High-performance and high-speed implementation of polynomial basis Itoh–Tsujii inversion algorithm over GF(2^{m})B Rashidi, RR Farashahi, SM Sayedi IET Information Security 11 (2), 66-77, 2017 | 22 | 2017 |

Efficient arithmetic on elliptic curves over fields of characteristic three RR Farashahi, H Wu, CA Zhao International Conference on Selected Areas in Cryptography, 135-148, 2012 | 20 | 2012 |

Efficient and low-complexity hardware architecture of Gaussian normal basis multiplication over GF(2^{m}) for elliptic curve cryptosystemsB Rashidi, SM Sayedi, RR Farashahi IET Circuits, Devices & Systems 11 (2), 103-112, 2017 | 19 | 2017 |

On the number of distinct elliptic curves in some families RR Farashahi, IE Shparlinski Designs, Codes and Cryptography 54 (1), 83-99, 2010 | 18 | 2010 |

Extractors for binary elliptic curves RR Farashahi, R Pellikaan, A Sidorenko Designs, Codes and Cryptography 49 (1), 171-186, 2008 | 15 | 2008 |

The quadratic extension extractor for (hyper) elliptic curves in odd characteristic RR Farashahi, R Pellikaan International Workshop on the Arithmetic of Finite Fields, 219-236, 2007 | 15 | 2007 |

Differential addition on twisted edwards curves RR Farashahi, SG Hosseini Australasian Conference on Information Security and Privacy, 366-378, 2017 | 14 | 2017 |

Differential addition on binary elliptic curves RR Farashahi, SG Hosseini International Workshop on the Arithmetic of Finite Fields, 21-35, 2016 | 12 | 2016 |

Efficient implementation of low time complexity and pipelined bit-parallel polynomial basis multiplier over binary finite fields B Rashidi, R Rezaeian Farashahi, SM Sayedi The ISC International Journal of Information Security 7 (2), 101-114, 2015 | 11 | 2015 |

Efficient implementation of bit-parallel fault tolerant polynomial basis multiplication and squaring over GF(2^{m})B Rashidi, SM Sayedi, RR Farashahi IET Computers & Digital Techniques 10 (1), 18-29, 2015 | 10 | 2015 |