![](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
Thomaz Oliveira
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
2010 – 2019
- 2019
- [j6]Thomaz Oliveira, Julio César López-Hernández, Daniel Cervantes-Vázquez
, Francisco Rodríguez-Henríquez:
Koblitz Curves over Quadratic Fields. J. Cryptol. 32(3): 867-894 (2019) - 2018
- [j5]Gora Adj, Isaac Canales-Martínez, Nareli Cruz Cortés, Alfred Menezes, Thomaz Oliveira, Luis Rivera-Zamarripa, Francisco Rodríguez-Henríquez:
Computing discrete logarithms in cryptographically-interesting characteristic-three finite fields. Adv. Math. Commun. 12(4): 741-759 (2018) - [j4]Thomaz Oliveira, Julio César López-Hernández, Francisco Rodríguez-Henríquez:
The Montgomery ladder on binary elliptic curves. J. Cryptogr. Eng. 8(3): 241-258 (2018) - 2017
- [c7]Thomaz Oliveira, Julio César López-Hernández, Hüseyin Hisil, Armando Faz-Hernández
, Francisco Rodríguez-Henríquez:
How to (Pre-)Compute a Ladder - Improving the Performance of X25519 and X448. SAC 2017: 172-191 - [i10]Thomaz Oliveira, Julio César López-Hernández, Francisco Rodríguez-Henríquez:
A note on how to (pre-)compute a ladder. IACR Cryptol. ePrint Arch. 2017: 264 (2017) - [i9]Thomaz Oliveira, Julio César López-Hernández, Francisco Rodríguez-Henríquez:
The Montgomery ladder on binary elliptic curves. IACR Cryptol. ePrint Arch. 2017: 350 (2017) - 2016
- [c6]Thomaz Oliveira, Julio César López-Hernández, Francisco Rodríguez-Henríquez:
Software Implementation of Koblitz Curves over Quadratic Fields. CHES 2016: 259-279 - [i8]Thomaz Oliveira, Julio César López-Hernández, Francisco Rodríguez-Henríquez:
Software implementation of Koblitz curves over quadratic fields. IACR Cryptol. ePrint Arch. 2016: 603 (2016) - [i7]Gora Adj, Isaac Canales-Martínez, Nareli Cruz Cortés, Alfred Menezes, Thomaz Oliveira, Luis Rivera-Zamarripa, Francisco Rodríguez-Henríquez:
Computing discrete logarithms in cryptographically-interesting characteristic-three finite fields. IACR Cryptol. ePrint Arch. 2016: 914 (2016) - 2015
- [j3]Gora Adj, Alfred Menezes, Thomaz Oliveira, Francisco Rodríguez-Henríquez:
Computing discrete logarithms using Joux's algorithm. ACM Commun. Comput. Algebra 49(2): 60 (2015) - [j2]Gora Adj, Alfred Menezes, Thomaz Oliveira, Francisco Rodríguez-Henríquez:
Weakness of 𝔽66·1429 and 𝔽24·3041 for discrete logarithm cryptography. Finite Fields Their Appl. 32: 148-170 (2015) - [c5]Jesús-Javier Chi-Domínguez, Thomaz Oliveira:
Attacking a Binary GLS Elliptic Curve with Magma. LATINCRYPT 2015: 308-326 - 2014
- [j1]Thomaz Oliveira, Julio César López-Hernández, Diego F. Aranha
, Francisco Rodríguez-Henríquez:
Two is the fastest prime: lambda coordinates for binary elliptic curves. J. Cryptogr. Eng. 4(1): 3-17 (2014) - [c4]Thomaz Oliveira, Diego F. Aranha
, Julio César López-Hernández, Francisco Rodríguez-Henríquez:
Fast Point Multiplication Algorithms for Binary Elliptic Curves with and without Precomputation. Selected Areas in Cryptography 2014: 324-344 - [c3]Gora Adj, Alfred Menezes, Thomaz Oliveira, Francisco Rodríguez-Henríquez:
Computing Discrete Logarithms in 𝔽36...137 and 𝔽36...163 Using Magma. WAIFI 2014: 3-22 - [i6]Gora Adj, Alfred Menezes, Thomaz Oliveira, Francisco Rodríguez-Henríquez:
Computing Discrete Logarithms in F36*137 using Magma. IACR Cryptol. ePrint Arch. 2014: 57 (2014) - [i5]Thomaz Oliveira, Diego F. Aranha, Julio César López-Hernández, Francisco Rodríguez-Henríquez:
Fast point multiplication algorithms for binary elliptic curves with and without precomputation. IACR Cryptol. ePrint Arch. 2014: 427 (2014) - 2013
- [c2]Thomaz Oliveira, Julio César López-Hernández, Diego F. Aranha
, Francisco Rodríguez-Henríquez:
Lambda Coordinates for Binary Elliptic Curves. CHES 2013: 311-330 - [c1]Gora Adj, Alfred Menezes, Thomaz Oliveira, Francisco Rodríguez-Henríquez:
Weakness of 𝔽36·509 for Discrete Logarithm Cryptography. Pairing 2013: 20-44 - [i4]Thomaz Oliveira, Julio César López-Hernández, Diego F. Aranha, Francisco Rodríguez-Henríquez:
Two is the fastest prime. IACR Cryptol. ePrint Arch. 2013: 131 (2013) - [i3]Gora Adj, Alfred Menezes, Thomaz Oliveira, Francisco Rodríguez-Henríquez:
Weakness of 𝔽36·509 for Discrete Logarithm Cryptography. IACR Cryptol. ePrint Arch. 2013: 446 (2013) - [i2]Gora Adj, Alfred Menezes, Thomaz Oliveira, Francisco Rodríguez-Henríquez:
Weakness of F36*1429 and F24*3041 for Discrete Logarithm Cryptography. IACR Cryptol. ePrint Arch. 2013: 737 (2013) - 2010
- [i1]Thomaz Oliveira, Julio César López-Hernández:
Improving the performance of Luffa Hash Algorithm. IACR Cryptol. ePrint Arch. 2010: 457 (2010)
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