default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArash Hariri
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2012
[p1]Arash Hariri, Arash Reyhani-Masoleh:
On Countermeasures Against Fault Attacks on Elliptic Curve Cryptography Using Fault Detection. Fault Analysis in Cryptography 2012: 157-169- 2011
- [j7]Arash Hariri, Arash Reyhani-Masoleh:
Concurrent Error Detection in Montgomery Multiplication over Binary Extension Fields. IEEE Trans. Computers 60(9): 1341-1353 (2011) - [j6]Arash Hariri, Arash Reyhani-Masoleh:
Digit-Level Semi-Systolic and Systolic Structures for the Shifted Polynomial Basis Multiplication Over Binary Extension Fields. IEEE Trans. Very Large Scale Integr. Syst. 19(11): 2125-2129 (2011)
2000 – 2009
- 2009
- [j5]Arash Hariri, Arash Reyhani-Masoleh:
Bit-Serial and Bit-Parallel Montgomery Multiplication and Squaring over GF(2^m). IEEE Trans. Computers 58(10): 1332-1345 (2009) - [i2]Reza Rastegar, Arash Hariri:
A Step Forward in Studying the Compact Genetic Algorithm. CoRR abs/0901.0598 (2009) - [i1]Arash Hariri, Keivan Navi, Reza Rastegar:
A High Dynamic Range 3-Moduli-Set with Efficient Reverse Converter. CoRR abs/0901.1123 (2009) - 2008
- [j4]Arash Hariri, Keivan Navi, Reza Rastegar:
A new high dynamic range moduli set with efficient reverse converter. Comput. Math. Appl. 55(4): 660-668 (2008) - [c7]Éric Schost, Arash Hariri:
Subquadratic Polynomial Multiplication over GF(2m) Using Trinomial Bases and Chinese Remaindering. Selected Areas in Cryptography 2008: 361-372 - [c6]Arash Hariri, Arash Reyhani-Masoleh:
Digit-Serial Structures for the Shifted Polynomial Basis Multiplication over Binary Extension Fields. WAIFI 2008: 103-116 - 2007
- [c5]Arash Hariri, Arash Reyhani-Masoleh:
Fault Detection Structures for the Montgomery Multiplication over Binary Extension Fields. FDTC 2007: 37-46 - 2006
- [j3]Reza Rastegar, Arash Hariri:
A Step Forward in Studying the Compact Genetic Algorithm. Evol. Comput. 14(3): 277-289 (2006) - [j2]Reza Rastegar, Mohammad Reza Meybodi, Arash Hariri:
A new fine-grained evolutionary algorithm based on cellular learning automata. Int. J. Hybrid Intell. Syst. 3(2): 83-98 (2006) - [j1]Reza Rastegar, Arash Hariri:
The Population-Based Incremental Learning Algorithm converges to local optima. Neurocomputing 69(13-15): 1772-1775 (2006) - 2005
- [c4]Arash Hariri, Reza Rastegar, Keivan Navi, Morteza Saheb Zamani
, Mohammad Reza Meybodi:
Cellular Learning Automata based Evolutionary Computing (CLA-EC) for Intrinsic Hardware Evolution. Evolvable Hardware 2005: 294-297 - [c3]Arash Hariri, Reza Rastegar, Morteza Saheb Zamani, Mohammad Reza Meybodi:
Parallel Hardware Implementation of Cellular Learning Automata Based Evolutionary Computing (CLA-EC) on FPGA. FCCM 2005: 311-314 - [c2]Reza Rastegar, Arash Hariri, M. Mazoochi:
A Convergence Proof for the Population Based Incremental Learning Algorithm. ICTAI 2005: 387-391 - 2004
- [c1]Reza Rastegar, A. R. Arasteh, Arash Hariri, Mohammad Reza Meybodi:
A Fuzzy Clustering Algorithm using Cellular Learning Automata based Evolutionary Algorithm. HIS 2004: 310-314
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-04-25 05:47 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:
