Thomaz Oliveira

According to our database1, Thomaz Oliveira authored at least 18 papers between 2010 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2019
Koblitz Curves over Quadratic Fields.
J. Cryptol., 2019

2018
The Montgomery ladder on binary elliptic curves.
J. Cryptogr. Eng., 2018

Computing discrete logarithms in cryptographically-interesting characteristic-three finite fields.
Adv. Math. Commun., 2018

2017
A note on how to (pre-)compute a ladder.
IACR Cryptol. ePrint Arch., 2017

How to (Pre-)Compute a Ladder - Improving the Performance of X25519 and X448.
Proceedings of the Selected Areas in Cryptography - SAC 2017, 2017

2016
Software Implementation of Koblitz Curves over Quadratic Fields.
Proceedings of the Cryptographic Hardware and Embedded Systems - CHES 2016, 2016

2015
Weakness of 𝔽<sub>6<sup>6·1429</sup></sub> and 𝔽<sub>2<sup>4·3041</sup></sub> for discrete logarithm cryptography.
Finite Fields Their Appl., 2015

Computing discrete logarithms using Joux's algorithm.
ACM Commun. Comput. Algebra, 2015

Attacking a Binary GLS Elliptic Curve with Magma.
Proceedings of the Progress in Cryptology - LATINCRYPT 2015, 2015

2014
Two is the fastest prime: lambda coordinates for binary elliptic curves.
J. Cryptogr. Eng., 2014

Computing Discrete Logarithms in F<sub>3<sup>6*137</sup></sub> using Magma.
IACR Cryptol. ePrint Arch., 2014

Computing Discrete Logarithms in 𝔽<sub>3<sup>6...137</sup></sub> and 𝔽<sub>3<sup>6...163</sup></sub> Using Magma.
Proceedings of the Arithmetic of Finite Fields - 5th International Workshop, 2014

Fast Point Multiplication Algorithms for Binary Elliptic Curves with and without Precomputation.
Proceedings of the Selected Areas in Cryptography - SAC 2014, 2014

2013
Two is the fastest prime.
IACR Cryptol. ePrint Arch., 2013

Weakness of F<sub>3<sup>6*1429</sup></sub> and F<sub>2<sup>4*3041</sup></sub> for Discrete Logarithm Cryptography.
IACR Cryptol. ePrint Arch., 2013

Weakness of 𝔽<sub>3<sup>6·509</sup></sub> for Discrete Logarithm Cryptography.
Proceedings of the Pairing-Based Cryptography - Pairing 2013, 2013

Lambda Coordinates for Binary Elliptic Curves.
Proceedings of the Cryptographic Hardware and Embedded Systems - CHES 2013, 2013

2010
Improving the performance of Luffa Hash Algorithm.
IACR Cryptol. ePrint Arch., 2010


  Loading...