Reza Rezaeian Farashahi

Orcid: 0000-0003-0063-3484

According to our database1, Reza Rezaeian Farashahi authored at least 34 papers between 2006 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Differential addition on binary elliptic curves.
Finite Fields Their Appl., March, 2023

2020
Uniform encodings to elliptic curves and indistinguishable point representation.
Des. Codes Cryptogr., 2020

2018
Injective Encodings to Binary Ordinary Elliptic Curves.
Proceedings of the Selected Areas in Cryptography - SAC 2018, 2018

2017
High-performance and high-speed implementation of polynomial basis Itoh-Tsujii inversion algorithm over GF(2<i> <sup>m</sup> </i>).
IET Inf. Secur., 2017

Full-custom hardware implementation of point multiplication on binary Edwards curves for application-specific integrated circuit elliptic curve cryptosystem applications.
IET Circuits Devices Syst., 2017

Efficient and low-complexity hardware architecture of Gaussian normal basis multiplication over GF(2<i> <sup>m</sup> </i>) for elliptic curve cryptosystems.
IET Circuits Devices Syst., 2017

High-speed Hardware Implementations of Point Multiplication for Binary Edwards and Generalized Hessian Curves.
IACR Cryptol. ePrint Arch., 2017

Differential Addition on Twisted Edwards Curves.
Proceedings of the Information Security and Privacy - 22nd Australasian Conference, 2017

2016
High-speed hardware architecture of scalar multiplication for binary elliptic curve cryptosystems.
Microelectron. J., 2016

An efficient and high-speed VLSI implementation of optimal normal basis multiplication over GF(2<sup>m</sup>).
Integr., 2016

Efficient implementation of bit-parallel fault tolerant polynomial basis multiplication and squaring over GF(2<i> <sup>m</sup> </i>).
IET Comput. Digit. Tech., 2016

High-speed VLSI implementation of Digit-serial Gaussian normal basis Multiplication over GF(2m).
IACR Cryptol. ePrint Arch., 2016

Isomorphism classes of Doche-Icart-Kohel curves over finite fields.
Finite Fields Their Appl., 2016

2015
Efficient implementation of low time complexity and pipelined bit-parallel polynomial basis multiplier over binary finite fields.
ISC Int. J. Inf. Secur., 2015

Efficient and Low-complexity Hardware Architecture of Gaussian Normal Basis Multiplication over GF(2m) for Elliptic Curve Cryptosystems.
IACR Cryptol. ePrint Arch., 2015

2014
FPGA based fast and high-throughput 2-slow retiming 128-bit AES encryption algorithm.
Microelectron. J., 2014

Hashing into Hessian curves.
Int. J. Appl. Cryptogr., 2014

High-speed and pipelined finite field bit-parallel multiplier over GF(2<sup>m</sup>) for elliptic curve cryptosystems.
Proceedings of the 11th International ISC Conference on Information Security and Cryptology, 2014

2013
Indifferentiable deterministic hashing to elliptic and hyperelliptic curves.
Math. Comput., 2013

2012
Pseudorandom Bits From Points on Elliptic Curves.
IEEE Trans. Inf. Theory, 2012

Efficient Arithmetic on Hessian Curves over Fields of Characteristic Three.
IACR Cryptol. ePrint Arch., 2012

Isomorphism classes of Edwards curves over finite fields.
Finite Fields Their Appl., 2012

On Group Structures Realized by Elliptic Curves over a Fixed Finite Field.
Exp. Math., 2012

Efficient Arithmetic on Elliptic Curves over Fields of Characteristic Three.
Proceedings of the Selected Areas in Cryptography, 19th International Conference, 2012

2010
On the number of distinct elliptic curves in some families.
Des. Codes Cryptogr., 2010

Efficient Arithmetic on Hessian Curves.
Proceedings of the Public Key Cryptography, 2010

2009
On hashing into elliptic curves.
J. Math. Cryptol., 2009

2008
Efficient arithmetic on elliptic curves using a mixed Edwards-Montgomery representation.
IACR Cryptol. ePrint Arch., 2008

Binary Edwards Curves.
IACR Cryptol. ePrint Arch., 2008

Extractors for binary elliptic curves.
Des. Codes Cryptogr., 2008

Extractors for Jacobians of Binary Genus-2 Hyperelliptic Curves.
Proceedings of the Information Security and Privacy, 13th Australasian Conference, 2008

2007
The Quadratic Extension Extractor for (Hyper)Elliptic Curves in Odd Characteristic.
Proceedings of the Arithmetic of Finite Fields, First International Workshop, 2007

Extractors for Jacobian of Hyperelliptic Curves of Genus 2 in Odd Characteristic.
Proceedings of the Cryptography and Coding, 2007

2006
Efficient Pseudorandom Generators Based on the DDH Assumption.
IACR Cryptol. ePrint Arch., 2006


  Loading...