default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDReza Rezaeian Farashahi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j20]Reza Rezaeian Farashahi, Mojtaba Fadavi, Soheila Sabbaghian:
Faster Complete Addition Laws for Montgomery Curves. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2024(4): 737-762 (2024)- 2023
- [j19]Reza Rezaeian Farashahi
, Seyed Gholamhossein Hosseini:
Differential addition on binary elliptic curves. Finite Fields Their Appl. 87: 102141 (2023) - 2020
- [j18]Mojtaba Fadavi, Reza Rezaeian Farashahi:
Uniform encodings to elliptic curves and indistinguishable point representation. Des. Codes Cryptogr. 88(8): 1479-1502 (2020)
2010 – 2019
- 2018
- [c12]Mojtaba Fadavi, Reza Rezaeian Farashahi, Soheila Sabbaghian:
Injective Encodings to Binary Ordinary Elliptic Curves. SAC 2018: 434-449 - 2017
- [j17]Bahram Rashidi, Sayed Masoud Sayedi, Reza Rezaeian Farashahi:
Efficient and low-complexity hardware architecture of Gaussian normal basis multiplication over GF(2 m ) for elliptic curve cryptosystems. IET Circuits Devices Syst. 11(2): 103-112 (2017) - [j16]Bahram Rashidi, Sayed Masoud Sayedi, Reza Rezaeian Farashahi:
Full-custom hardware implementation of point multiplication on binary Edwards curves for application-specific integrated circuit elliptic curve cryptosystem applications. IET Circuits Devices Syst. 11(6): 568-578 (2017) - [j15]Bahram Rashidi, Reza Rezaeian Farashahi, Sayed Masoud Sayedi:
High-performance and high-speed implementation of polynomial basis Itoh-Tsujii inversion algorithm over GF(2 m ). IET Inf. Secur. 11(2): 66-77 (2017) - [c11]Reza Rezaeian Farashahi, Seyed Gholamhossein Hosseini:
Differential Addition on Twisted Edwards Curves. ACISP (2) 2017: 366-378 - [i11]Bahram Rashidi, Reza Rezaeian Farashahi, Sayed Masoud Sayedi:
High-speed Hardware Implementations of Point Multiplication for Binary Edwards and Generalized Hessian Curves. IACR Cryptol. ePrint Arch. 2017: 5 (2017) - 2016
- [j14]Reza Rezaeian Farashahi, Mehran Hosseini:
Isomorphism classes of Doche-Icart-Kohel curves over finite fields. Finite Fields Their Appl. 39: 111-129 (2016) - [j13]Bahram Rashidi, Sayed Masoud Sayedi, Reza Rezaeian Farashahi:
Efficient implementation of bit-parallel fault tolerant polynomial basis multiplication and squaring over GF(2 m ). IET Comput. Digit. Tech. 10(1): 18-29 (2016) - [j12]Bahram Rashidi, Sayed Masoud Sayedi, Reza Rezaeian Farashahi:
An efficient and high-speed VLSI implementation of optimal normal basis multiplication over GF(2m). Integr. 55: 138-154 (2016) - [j11]Bahram Rashidi, Sayed Masoud Sayedi, Reza Rezaeian Farashahi:
High-speed hardware architecture of scalar multiplication for binary elliptic curve cryptosystems. Microelectron. J. 52: 49-65 (2016) - [c10]Reza Rezaeian Farashahi, Seyed Gholamhossein Hosseini:
Differential Addition on Binary Elliptic Curves. WAIFI 2016: 21-35 - [i10]Bahram Rashidi, Sayed Masoud Sayedi, Reza Rezaeian Farashahi:
High-speed VLSI implementation of Digit-serial Gaussian normal basis Multiplication over GF(2m). IACR Cryptol. ePrint Arch. 2016: 966 (2016) - 2015
- [j10]Bahram Rashidi, Reza Rezaeian Farashahi, Sayed Masoud Sayedi:
Efficient implementation of low time complexity and pipelined bit-parallel polynomial basis multiplier over binary finite fields. ISC Int. J. Inf. Secur. 7(2): 101-114 (2015) - [i9]Bahram Rashidi, Sayed Masoud Sayedi, Reza Rezaeian Farashahi:
Efficient and Low-complexity Hardware Architecture of Gaussian Normal Basis Multiplication over GF(2m) for Elliptic Curve Cryptosystems. IACR Cryptol. ePrint Arch. 2015: 1109 (2015) - 2014
- [j9]Reza Rezaeian Farashahi:
Hashing into Hessian curves. Int. J. Appl. Cryptogr. 3(2): 139-147 (2014) - [j8]Reza Rezaeian Farashahi, Bahram Rashidi, Sayed Masoud Sayedi:
FPGA based fast and high-throughput 2-slow retiming 128-bit AES encryption algorithm. Microelectron. J. 45(8): 1014-1025 (2014) - [c9]Bahram Rashidi, Reza Rezaeian Farashahi, Sayed Masoud Sayedi:
High-speed and pipelined finite field bit-parallel multiplier over GF(2m) for elliptic curve cryptosystems. ISCISC 2014: 15-20 - 2013
- [j7]Reza Rezaeian Farashahi, Pierre-Alain Fouque, Igor E. Shparlinski, Mehdi Tibouchi, José Felipe Voloch:
Indifferentiable deterministic hashing to elliptic and hyperelliptic curves. Math. Comput. 82(281): 491-512 (2013) - 2012
- [j6]Reza Rezaeian Farashahi, Igor E. Shparlinski:
On Group Structures Realized by Elliptic Curves over a Fixed Finite Field. Exp. Math. 21(1): 1-10 (2012) - [j5]Reza Rezaeian Farashahi, Dustin Moody, Hongfeng Wu:
Isomorphism classes of Edwards curves over finite fields. Finite Fields Their Appl. 18(3): 597-612 (2012) - [j4]Reza Rezaeian Farashahi, Igor E. Shparlinski:
Pseudorandom Bits From Points on Elliptic Curves. IEEE Trans. Inf. 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 Cryptol. ePrint Arch. 2012: 122 (2012) - 2011
- [c7]Reza Rezaeian Farashahi:
Hashing into Hessian Curves. AFRICACRYPT 2011: 278-289 - [i7]Reza Rezaeian Farashahi, Dustin Moody, Hongfeng Wu:
Isomorphism classes of Edwards curves over finite fields. IACR Cryptol. ePrint Arch. 2011: 206 (2011) - 2010
- [j3]Reza Rezaeian Farashahi, Igor E. Shparlinski:
On the number of distinct elliptic curves in some families. Des. Codes Cryptogr. 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 E. Shparlinski:
Pseudorandom Bits From Points on Elliptic Curves. CoRR abs/1005.4771 (2010) - [i5]Reza Rezaeian Farashahi:
Hashing into Hessian Curves. IACR Cryptol. ePrint Arch. 2010: 373 (2010) - [i4]Reza Rezaeian Farashahi, Pierre-Alain Fouque, Igor E. Shparlinski, Mehdi Tibouchi, José Felipe Voloch:
Indifferentiable Deterministic Hashing to Elliptic and Hyperelliptic Curves. IACR Cryptol. ePrint Arch. 2010: 539 (2010)
2000 – 2009
- 2009
- [j2]Reza Rezaeian Farashahi, Igor E. Shparlinski, José Felipe Voloch:
On hashing into elliptic curves. J. Math. Cryptol. 3(4): 353-360 (2009) - 2008
- [j1]Reza Rezaeian Farashahi, Ruud Pellikaan, Andrey Sidorenko:
Extractors for binary elliptic curves. Des. Codes Cryptogr. 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 Cryptol. ePrint Arch. 2008: 171 (2008) - [i2]Wouter Castryck, Steven D. Galbraith, Reza Rezaeian Farashahi:
Efficient arithmetic on elliptic curves using a mixed Edwards-Montgomery representation. IACR Cryptol. ePrint Arch. 2008: 218 (2008) - 2007
- [c3]Reza Rezaeian Farashahi:
Extractors for Jacobian of Hyperelliptic Curves of Genus 2 in Odd Characteristic. IMACC 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 Cryptol. ePrint Arch. 2006: 321 (2006)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-21 02:36 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
