![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Jamshid Shokrollahi
Person information
Refine list
![note](https://dblp.dagstuhl.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2008
- [c11]Christoph Bösch, Jorge Guajardo, Ahmad-Reza Sadeghi, Jamshid Shokrollahi, Pim Tuyls:
Efficient Helper Data Key Extractor on FPGAs. CHES 2008: 181-197 - [c10]Christoph Puttmann, Jamshid Shokrollahi, Mario Porrmann
:
Resource Efficiency of Instruction Set Extensions for Elliptic Curve Cryptography. ITNG 2008: 131-136 - 2007
- [j1]Zekeriya Erkin
, Alessandro Piva
, Stefan Katzenbeisser, Reginald L. Lagendijk, Jamshid Shokrollahi, Gregory Neven, Mauro Barni:
Protection and Retrieval of Encrypted Multimedia Content: When Cryptography Meets Signal Processing. EURASIP J. Inf. Secur. 2007 (2007) - [c9]Jamshid Shokrollahi, Elisa Gorla
, Christoph Puttmann:
Efficient FPGA-based multipliers for F_3^97 and F_3^(6*97). FPL 2007: 339-344 - [c8]Elisa Gorla, Christoph Puttmann, Jamshid Shokrollahi:
Explicit Formulas for Efficient Multiplication in \mathbbF36m. Selected Areas in Cryptography 2007: 173-183 - [c7]Joachim von zur Gathen, Amin Shokrollahi, Jamshid Shokrollahi:
Efficient Multiplication Using Type 2 Optimal Normal Bases. WAIFI 2007: 55-68 - [i2]Elisa Gorla, Christoph Puttmann, Jamshid Shokrollahi:
Explicit formulas for efficient multiplication in F_{3^{6m}}. CoRR abs/0708.3014 (2007) - [i1]Jamshid Shokrollahi, Elisa Gorla, Christoph Puttmann:
Efficient FPGA-based multipliers for F_{3^97} and F_{3^{6*97}}. CoRR abs/0708.3022 (2007) - 2006
- [b1]Jamshid Shokrollahi:
Efficient implementation of elliptic curve cryptography on FPGAs. University of Bonn, Germany, 2006, pp. 1-141 - [c6]Joachim von zur Gathen, Jamshid Shokrollahi:
Fast arithmetic for polynomials over F2in hardware. ITW 2006: 107-111 - 2005
- [c5]Joachim von zur Gathen, Jamshid Shokrollahi:
Efficient FPGA-Based Karatsuba Multipliers for Polynomials over F2. Selected Areas in Cryptography 2005: 359-369 - 2003
- [c4]Cornelia Grabbe, Marcus Bednara, Joachim von zur Gathen, Jamshid Shokrollahi, Jürgen Teich:
A High Performance VLIW Processor for Finite Field Arithmetic. IPDPS 2003: 189 - [c3]Cornelia Grabbe, Marcus Bednara, Jürgen Teich, Joachim von zur Gathen, Jamshid Shokrollahi:
FPGA designs of parallel high performance GF(2233) multipliers. ISCAS (2) 2003: 268-271 - 2002
- [c2]Marcus Bednara, M. Daldrup, Joachim von zur Gathen, Jamshid Shokrollahi, Jürgen Teich:
Reconfigurable Implementation of Elliptic Curve Crypto Algorithms. IPDPS 2002 - [c1]Marcus Bednara, M. Daldrup, Jürgen Teich, Joachim von zur Gathen, Jamshid Shokrollahi:
Tradeoff analysis of FPGA based elliptic curve cryptography. ISCAS (5) 2002: 797-800
Coauthor Index
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
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:49 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint