Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 97 matches
- 2023
- Dmitrii I. Koshelev:
Subgroup membership testing on elliptic curves via the Tate pairing. J. Cryptogr. Eng. 13(1): 125-128 (2023) - Damien Robert:
The geometric interpretation of the Tate pairing and its applications. IACR Cryptol. ePrint Arch. 2023: 177 (2023) - 2022
- Dmitrii I. Koshelev:
Subgroup membership testing on elliptic curves via the Tate pairing. IACR Cryptol. ePrint Arch. 2022: 37 (2022) - 2019
- Takakazu Satoh:
Miller Inversion is Easy for the Reduced Tate Pairing on Trace Zero Supersingular Curves. IACR Cryptol. ePrint Arch. 2019: 385 (2019) - 2018
- Balaji Chandrasekaran, Ramadoss Balakrishnan:
An Efficient Tate Pairing Algorithm for a Decentralized Key-Policy Attribute Based Encryption Scheme in Cloud Environments. Cryptogr. 2(3): 14 (2018) - Srinath Doss, Roselyn Kaondera-Shava:
An optimal Tate pairing computation using Jacobi quartic elliptic curves. J. Comb. Optim. 35(4): 1086-1103 (2018) - 2016
- Srinivasa Rao Subramanya Rao:
An Improved EllipticNet Algorithm for Tate Pairing on Weierstrass' Curves, Faster Point Arithmetic and Pairing on Selmer Curves and a Note on Double Scalar Multiplication. ATIS 2016: 93-105 - 2015
- Ronan Lashermes, Jacques J. A. Fournier, Louis Goubin:
Inverting the Final exponentiation of Tate pairings on ordinary elliptic curves using faults. IACR Cryptol. ePrint Arch. 2015: 152 (2015) - 2014
- Yutaro Kiyomura, Tsuyoshi Takagi:
Efficient Algorithm for Tate Pairing of Composite Order. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 97-A(10): 2055-2063 (2014) - Christophe Tran:
Formulae for Computation of Tate Pairing on Hyperelliptic Curve Using Hyperelliptic Nets. AFRICACRYPT 2014: 199-214 - 2013
- Taechan Kim, Sungwook Kim, Jung Hee Cheon:
On the Final Exponentiation in Tate Pairing Computations. IEEE Trans. Inf. Theory 59(6): 4033-4041 (2013) - Ronan Lashermes, Jacques J. A. Fournier, Louis Goubin:
Inverting the Final Exponentiation of Tate Pairings on Ordinary Elliptic Curves Using Faults. CHES 2013: 365-382 - Zhi Hu, Lin Wang, Maozhi Xu, Guoliang Zhang:
Generation and Tate Pairing Computation of Ordinary Elliptic Curves with Embedding Degree One. ICICS 2013: 393-403 - Yulong Tian, Dawu Gu, Haihua Gu:
Efficient Implementation of Tate Pairing with Montgomery Ladder Method. INCoS 2013: 398-402 - Yutaro Kiyomura, Tsuyoshi Takagi:
Efficient Algorithm for Tate Pairing of Composite Order. IWSEC 2013: 201-216 - Yuki Kono, Taichi Sumo, Yasuyuki Nogami:
A Smaller Final Exponentiation for Tate and Ate Pairings with Barreto-Naehrig Curve. NBiS 2013: 518-522 - 2012
- Zhitu Su, Chunhui Sun, Hui Li, Jianfeng Ma:
A method for efficient parallel computation of Tate pairing. Int. J. Grid Util. Comput. 3(1): 43-52 (2012) - Sylvain Duquesne, Emmanuel Fouotsa:
Tate Pairing Computation on Jacobi's Elliptic Curves. Pairing 2012: 254-269 - Yukihiro Uchida, Shigenori Uchiyama:
The Tate-Lichtenbaum Pairing on a Hyperelliptic Curve via Hyperelliptic Nets. Pairing 2012: 218-233 - Liangze Li, Fan Zhang:
Tate Pairing Computation on Generalized Hessian Curves. WISA 2012: 111-123 - Rkia Aouinatou, Mostafa Belkasmi:
Cyptanalysis CDHP , BDHP and Tate pairing under certain conditions The Tate pairing is less secure than Weil. IACR Cryptol. ePrint Arch. 2012: 277 (2012) - Taechan Kim, Sungwook Kim, Jung Hee Cheon:
Accelerating the Final Exponentiation in the Computation of the Tate Pairings. IACR Cryptol. ePrint Arch. 2012: 119 (2012) - 2011
- Guangming Dai, Maocai Wang, Lei Peng, Ruijie Qin:
Implementation And Optimization For Tate Pairing. Intell. Autom. Soft Comput. 17(5): 607-617 (2011) - Weibo Pan, William P. Marnane:
A Correlation Power Analysis Attack against Tate Pairing on FPGA. ARC 2011: 340-349 - Xusheng Zhang, Shan Chen, Dongdai Lin:
Fast Tate Pairing Computation on Twisted Jacobi Intersections Curves. Inscrypt 2011: 210-226 - Diego F. Aranha, Edward Knapp, Alfred Menezes, Francisco Rodríguez-Henríquez:
Parallelizing the Weil and Tate Pairings. IMACC 2011: 275-295 - Zhitu Su, Chunhui Sun, Hui Li, Jianfeng Ma, Kai Fan:
Fast Parallel Computation of Tate Pairing. INCoS 2011: 178-183 - 2010
- Tom A. Fisher, Edward F. Schaefer, Michael Stoll:
The yoga of the Cassels-Tate pairing. LMS J. Comput. Math. 13: 451-460 (2010) - Weibo Pan, William P. Marnane:
A Reconfigurable Implementation of the Tate Pairing Computation over GF(2m). ARC 2010: 80-91 - Nicolas Estibals:
Compact Hardware for Computing the Tate Pairing over 128-Bit-Security Supersingular Curves. Pairing 2010: 397-416
skipping 67 more matches
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-04-26 19:49 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint