Výsledky vyhledávání - "Fouotsa Emmanuel"

Akademický článek

Autor: Perez Broon Fouazou Lontouo, Dang Thinh, Fouotsa Emmanuel, Moody Dustin

Publikováno v: Journal of Mathematical Cryptology, Vol 15, Iss 1, Pp 345-358 (2021)

Elliptic curves are typically defined by Weierstrass equations. Given a kernel, the well-known Vélu's formula shows how to explicitly write down an isogeny between Weierstrass curves. However, it is not clear how to do the same on other forms of ell

Externí odkaz: https://doaj.org/article/747aa72bd8b049b7b9ad38fb317f4591

Zobrazit plný text záznamu

Akademický článek

Efficient computation of pairings on Jacobi quartic elliptic curves

Autor: Duquesne Sylvain, El Mrabet Nadia, Fouotsa Emmanuel

Publikováno v: Journal of Mathematical Cryptology, Vol 8, Iss 4, Pp 331-362 (2014)

This paper proposes the computation of the Tate pairing, Ate pairing and its variations on the special Jacobi quartic elliptic curve Y2=dX4+Z4$Y^{2}=dX^{4}+Z^{4}$. We improve the doubling and addition steps in Miller's algorithm to compute the Tate p

Externí odkaz: https://doaj.org/article/90e9c48717644342a73981b3141bc337

Zobrazit plný text záznamu

Report

Low-Rank Parity-Check Codes Over Finite Commutative Rings

Autor: Kamche, Hermann Tchatchiem, Kalachi, Hervé Talé, Djomou, Franck Rivel Kamwa, Fouotsa, Emmanuel

Low-Rank Parity-Check (LRPC) codes are a class of rank metric codes that have many applications specifically in network coding and cryptography. Recently, LRPC codes have been extended to Galois rings which are a specific case of finite rings. In thi

Externí odkaz: http://arxiv.org/abs/2106.08712

Zobrazit plný text záznamu

Report

Parallel Computation of Optimal Ate Cryptographic Pairings at the $128$, $192$ and $256$-bit security levels using elliptic net algorithm

Autor: Mbang, Narcisse Bang, Fouotsa, Emmanuel, Lele, Celestin

Efficient computations of pairings with Miller Algorithm have recently received a great attention due to the many applications in cryptography. In this work, we give formulae for the optimal Ate pairing in terms of elliptic nets associated to twisted

Externí odkaz: http://arxiv.org/abs/2003.11286

Zobrazit plný text záznamu

Report

Optimal Ate Pairing on Elliptic Curves with Embedding Degree $9,15$ and $27$

Autor: Fouotsa, Emmanuel, Mrabet, Nadia El, Pecha, Aminatou

Publikováno v: journal of Groups, complexity, cryptology, Volume 12, Issue 1 (April 17, 2020) gcc:6167

Much attention has been given to the efficient computation of pairings on elliptic curves with even embedding degree since the advent of pairing-based cryptography. The few existing works in the case of odd embedding degrees require some improvements

Externí odkaz: http://arxiv.org/abs/2002.11920

Zobrazit plný text záznamu