Gora Adj

Orcid: 0000-0002-9308-1510

According to our database1, Gora Adj authored at least 18 papers between 2013 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
MiRitH: Efficient Post-Quantum Signatures from MinRank in the Head.
IACR Trans. Cryptogr. Hardw. Embed. Syst., 2024

PQC-AMX: Accelerating Saber and FrodoKEM on the Apple M1 and M3 SoCs.
IACR Cryptol. ePrint Arch., 2024

2023
Karatsuba-based square-root Vélu's formulas applied to two isogeny-based protocols.
J. Cryptogr. Eng., April, 2023

2022
MinRank in the Head: Short Signatures from Zero-Knowledge Proofs.
IACR Cryptol. ePrint Arch., 2022

Faulty isogenies: a new kind of leakage.
IACR Cryptol. ePrint Arch., 2022

A Parallel Strategy for Solving Sparse Linear Systems Over Finite Fields.
Computación y Sistemas, 2022

2020
On new Vélu's formulae and their applications to CSIDH and B-SIDH constant-time implementations.
IACR Cryptol. ePrint Arch., 2020

2019
On isogeny graphs of supersingular elliptic curves over finite fields.
Finite Fields Their Appl., 2019

2018
Smoothness Test for Polynomials Defined Over Small Characteristic Finite Fields.
Math. Comput. Sci., 2018

On the cost of computing isogenies between supersingular elliptic curves.
IACR Cryptol. ePrint Arch., 2018

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

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

2014
Square Root Computation over Even Extension Fields.
IEEE Trans. Computers, 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

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.
IACR Cryptol. ePrint Arch., 2013


  Loading...