UBa Cyber Crypto Center

Written publications

We are actively finding new and effective ways to ensure security through adequate and proper research.

Selected publications of Boris TAKO FOUOTSA

[1] Andrea Basso,Mingjie Chen,Peter Kutas,Abel Laval,Laurane Marco,and Gustave Tchoffo Saah. (2024) Exploring SIDH-based Signature Parameters. To appear at ACNS 2024, 2024 . https://eprint.iacr.org/2023/1906
[2] Andrea Basso,Giulio Codogni,Deirdre Connolly,Luca De Feo,Guido Maria Lido,Travis Morrison,Lorenz Panny,Sikhar Patranabis,and Benjamin Wesolowski. (2023) Supersingular curves you can trust. In Carmit Hazay and Martijn Stam, editors, EUROCRYPT 2023, Part II, volume 14005 of LNCS, pages 405–437. Springer, Heidelberg, April 2023. . https://link.springer.com/chapter/10.1007/978-3-031-30617-4_14
[3] Andrea Basso (2023) New SIDH Countermeasures for a More Efficient Key Exchange. To appear at ASIACRYT 2023, 2023. . https://eprint.iacr.org/2023/791
[4] Jeremy Booher,Ross Bowden,Javad Doliskani,Steven D Galbraith,Sabrina Kunzweiler,Simon-Philipp Merz,Christophe Petit,Benjamin Smith,Katherine E Stange,Yan Bo Ti,Christelle Vincent,Jose Felipe Voloch,Charlotte Weitk¨amper,and Lucas Zobernig. (2022) Failing to hash into supersingular isogeny graphs. Extended abstract at CFAIL 2022, 2022. . https://eprint.iacr.org/2022/518.pdf
[5] Luca De Feo,Cyprien Delpech de Saint Guilhem,Peter Kutas,Antonin Leroux,Christophe Petit,Javier Silva,and Benjamin Wesolowski. Seta (2021) from torsion attacks. In Mehdi Tibouchi and Huaxiong Wang, editors, ASIACRYPT 2021, Part IV, volume 13093 of LNCS, pages 249–278. Springer, Heidelberg, December 2021. . https://link.springer.com/chapter/10.1007/978-3-030-92068-5_9
[6] Luca De Feo,Peter Kutas,Antonin Leroux,Simon-Philipp Merz,Lorenz Panny,and Benjamin Wesolowski. (2023) SCALLOP: Scaling the CSI-FiSh. In Alexandra Boldyreva and Vladimir Kolesnikov, editors, PKC 2023, Part I, volume 13940 of LNCS, pages 345–375. Springer, Heidelberg, May 2023. . https://link.springer.com/chapter/10.1007/978-3-031-31368-4_13
[7] Peter Kutas,Simon-Philipp Merz,and Yan Bo Ti (2022) On the isogeny problem with torsion point information. In Goichiro Hanaoka, Junji Shikata, and Yohei Watanabe, editors, PKC 2022, Part I, volume 13177 of LNCS, pages 142–161. Springer, Heidelberg, March 2022. . https://link.springer.com/chapter/10.1007/978-3-030-97121-2_6
[8] Tomoki Moriya,and Christophe Petit. M-SIDH and MD-SIDH (2023) : Countering SIDH attacks by masking information. In Carmit Hazay and Martijn Stam, editors, EUROCRYPT 2023, Part V, volume 14008 of LNCS, pages 282–309. Springer, Heidelberg, April 2023. . https://link.springer.com/chapter/10.1007/978-3-031-30589-4_10
[9] Christophe Petit (2021) SHealS and HealS: Isogeny-based PKEs from a key validation method for SIDH. In Mehdi Tibouchi and Huaxiong Wang, editors, ASIACRYPT 2021, Part IV, volume 13093 of LNCS, pages 279–307. Springer, Heidelberg, December 2021. . https://research.birmingham.ac.uk/en/publications/sheals-andheals-isogeny-based-pkes-from-a-key-validation-method-f
[10] Christophe Petit (2021) SimS: A simplification of SiGamal. In Jung Hee Cheon and Jean-Pierre Tillich, editors, Post-Quantum Cryptography, 12th International Workshop, PQCrypto 2021, pages 277–295. Springer, Heidelberg, 2021. . https://research.birmingham.ac.uk/en/publications/sims-a-simplification-of-sigamal
[11] Christophe Petit (2022) A new adaptive attack on sidh. In Cryptographers’ Track at the RSA Conference, pages 322–344. Springer, 2022 . https://link.springer.com/chapter/10.1007/978-3-030-95312-6_14

Selected publications of CHRISTOPHE Petit

[1] Tako Boris Fouotsa (2022) A new adaptive attack on sidh. In Cryptographers’ Track at the RSA Conference, pages 322–344. Springer, 2022 . https://dl.acm.org/doi/10.1007/978-3-030-95312-6_14
[2] Elisa Gorla,Daniela Mueller (2020) Stronger bounds on the cost of computing Groebner basis for HFE systems. Journal of Symbolic Computation, 109 (special issue for MEGA 2019 conference), pp 386-398. . https://www.researchgate.net/publication/342789332_Stronger_bounds_on_the_cost_of_computing_Grobner_bases_for_HFE_systems
[3] Andrea Basso and Peter Kutas and Simon-Philipp Merz,and Antonio Sanso (2021) Cryptanalysis of an oblivious PRF from supersingular isogenies. To appear at ASIACRYPT 2021. . https://eprint.iacr.org/2021/706
[4] Tako Boris Fouotsa (2021) SHealS and HealS: Isogeny-based PKEs from a key validation method for SIDH. In Mehdi Tibouchi and Huaxiong Wang, editors, ASIACRYPT 2021, Part IV, volume 13093 of LNCS, pages 279–307. Springer, Heidelberg, December 2021 . https://research.birmingham.ac.uk/en/publications/sheals-andheals-isogeny-based-pkes-from-a-key-validation-method-f
[5] Luca De Feo,Boris Fouotsa,Cyprien Delpech de Saint-Guilhem,Antonin Leroux,Peter Kutas,Javier Silva,Benjamin Wesolowski.Seta (2021) : Supersingular encryption from torsion attacks. To appear at ASIACRYPT 2021. . https://eprint.iacr.org/2019/1291
[6] Marie Euler (2021) New results on Quasi-Subfield Polynomials. Finite Fields and Applications, vol 75, 2021. . https://www.sciencedirect.com/science/article/abs/pii/S1071579721000757#!
[7] Victoria De Quehen,Peter Kutas,Chris Leonardi,Chloe Martindale,Lorenz Pany,Kate Stange (2021) Kate Stange Improved torsion-point attacks on SIDH variants. Advances in Cryptology - CRYPTO 2021, LNCS 12827, pp 432-470 . https://research.birmingham.ac.uk/en/publications/improved-torsion-point-attacks-on-sidh-variants
[8] Tako Boris Fouotsa,SimS (2021) : A simplification of SiGamal. In Jung Hee Cheon and Jean-Pierre Tillich, editors, Post-Quantum Cryptography - 12th International Workshop, PQCrypto 2021, pages 277–295. Springer, Heidelberg, 2021 . https://dl.acm.org/doi/proceedings/10.1007/978-3-030-81293-5
[9] Peter Kutas,Simon-Philipp Merz,Charlotte Weitk¨amper (2021) One-way functions and malleability oracles: Hidden shift attacks on isogenybased protocols Advances in Cryptology - EUROCRYPT 2021, LNCS 12696, pp 242-271. . https://eprint.iacr.org/2021/282
[10] Peter Kutas,Javier Silva (2020) Trapdoor DDH groups, revisited. Selected Areas in Cryptography - SAC 2020, LNCS 12804, pp 431-450. . https://eprint.iacr.org/2019/1290
[11] Steven Galbraith; Robert Granger; Simon-Philipp Merz; (2020) On Index Calculus Algorithms for Subfield Curves. Selected Areas in Cryptography - SAC 2020, LNCS 12804, pp 115-138. . https://eprint.iacr.org/2020/1315
[12] OT Cyprien Delpech de Saint Guilhem,Emmanuela Orsini,Nigel Smart (2020) Semi-commutative Masking: A Framework for Isogeny-Based Protocols, with an Application to Fully Secure Two-Round Isogeny-Based, Cryptology and Network Security - CANS 2020, LNCS 12579, pp 235-258. . https://research.birmingham.ac.uk/en/publications/semi-commutative-masking-a-framework-for-isogeny-based-protocols-
[13] Luca De Feo,David Kohel,Antonin Leroux,Benjamin Wesolowski (2020) SQISign: Compact Post-Quantum signatures from Quaternions and Isogenies. Advances in Cryptology - ASIACRYPT 2020, LNCS 12491, pp 64-93. (BEST PAPER AWARD.) . https://research.birmingham.ac.uk/en/publications/sqisign-compact-post-quantum-signatures-from-quaternions-and-isog-2
[14] Andrea Basso,Peter Kutas,Simon-Philipp Merz,and Charlotte (2020) Weitkamper On Adaptive Attacks against Jao-Urbanik’s Isogeny-Based Protocol. Andrea Basso, Peter Kutas, Simon-Philipp Merz, Christophe Petit, and Charlotte Weitkamper. Progress in Cryptology - AFRICACRYPT 2020, LNCS 12174, pp 195-213 . https://www.researchgate.net/publication/342678951_On_Adaptive_Attacks_Against_Jao-Urbanik's_Isogeny-Based_Protocol

Selected publications of FOUOTSA Emmanuel

[1] Nadia EL Mrabet (2015) Failure of the Point Blinding Countermeasure Against Fault Attack in Pairing-Based Cryptography, In Codes, Cryptology, and Information Security. Vol 9084. pp 259-273, Springer, (2015) . https://link.springer.com/chapter/10.1007/978-3-319-18681-8_21
[2] Loubna Ghammam (2016) Adequate Elliptic Curves for Computing the Product of n Pairings In Arithmetic of Finite Fields. Vol 10064. pp 36- 53 Springer, (2016) . https://hal.science/hal-01548925
[3] Abdoul Aziz Ciss (2016) Faster Ate Pairings Computation on Selmer model of elliptic Curves In Groups, complexity and Cryptology, Vol.8(1), pp 55-67, DeGruyter (2016) . https://www.degruyter.com/document/doi/10.1515/gcc-2016-0005/html
[4] Oumar Diao (2017) A Theta Model of Elliptic Curves In Mediterraneen Journal of Mathematics. Vol 14(2). Birkhauser (2017) . https://www.researchgate.net/publication/314194351_A_Theta_Model_for_Elliptic_Curves
[5] Loubna Ghammam (2018) Improving the Computation of Optimal Ate pairing at the Higher Security Level , In Journal of Applied Mathematics and Computing, Vol. 59, pp 21-36, Springer, (2018) . https://www.researchgate.net/publication/322898581_Improving_the_computation_of_the_optimal_ate_pairing_for_a_high_security_level
[6] Nafissatou Diara (2018) An Encoding to the Level Four Theta Model of Elliptic Curve , Innovations and Interdisciplinary Solutions for underserved Areas, LNICST Vol 249, pp 224-235, Springer (2018) . https://www.researchgate.net/publication/314194351_A_Theta_Model_for_Elliptic_Curves
[7] (2019) Parallelizing Ate Pairing on Hessian Elliptic Curve, In Arab Journal of Mathematics, Vol 25(1), pp 29-42, Elsevier, (2019) . https://www.sciencedirect.com/science/article/pii/S1319516618300161
[8] Aminatou Pecha,and Nadia El Mrabet (2019) Beta Weil Pairing Revisited, Afrika Matematika, Vol. 30 pp 371–388. Springer, (2019) . https://link.springer.com/journal/13370/volumes-and-issues/30-3
[9] Abderrahmane Nitaj (2019) A New Attack on RSA and Demytko’s Elliptic Curve Cryptosystem, In Journal of Discrete Mathematical Science and Cryptography, Vol. 22(3) , pp 391-409, Taylors and Francis, (2019) . https://www.tandfonline.com/doi/abs/10.1080/09720529.2019.1587827
[10] Oumar Diao (2019) Complete Addition Formulas on Level Four Theta Model of Elliptic Curves. In Afrika Mathematika, \\DOI: 10.1007/s13370- 019-00736-6 Springer (2019) . https://link.springer.com/article/10.1007/s13370-019-00736-6
[11] Narcisse Mbang Biang,and Diego De Freitas Aranha (2019) Computing the Optimal Ate Pairing over Elliptic Curves with Embedding Degrees $54$ and $48$ at the $256$-bit security level, In International Journal of Applied Cryptography, DOI: 10.1504/IJACT.2020.10027563, Indersciences (2019) . https://www.researchgate.net/publication/337011283_Computing_the_Optimal_Ate_Pairing_over_Elliptic_Curves_with_Embedding_Degrees_54_and_48_at_the_256-bit_security_level
[12] Laurian Azebaze Guimagang (2019) Fast Hashing to $G_2$ on Aurifeuillean Pairing-Friendly Elliptic Curves. In SN Computer Sciences, Vol. 1(1), 51 DOI :10.1007/s42979-019-0053-5 Springer, (2019) . https://www.academia.edu/97263345/Fast_Hashing_to_mathbb_G_2_G2_on_Aurifeuillean_Pairing_Friendly_Elliptic_Curves?uc-sb-sw=57874637
[13] Perez F. Lontouo,and Daniel Tieudjo (2020) Division Polynomials on the Hessian Model of Elliptic Curves. In Applicable Algebra in Engineering, Communication and Computing, Springer (2020) Vol. 34, Pages 1-16, DOI : 10.1007/s00200-020-00470-8 . https://link.springer.com/article/10.1007/s00200-020-00470-8
[14] Anne Hanwa (2021) Elliptic divisibility sequences over the Edwards model of elliptic curves, In Journal of Discrete Mathematical Science and Cryptography, Taylor and Francis (2021) Vol. 25 (8) : https ://doi.org/10.1080/09720529.2020.1822042. . https://www.tandfonline.com/doi/pdf/10.1080/09720529.2020.1822042
[15] Perez F. Lontouo,and Dustin Moody,and Thinh Dang (2021) :Isogenies on Twisted Hessian Curves; In Journal of Mathematical Cryptology, De Gruyter (2021) ; Vol 15 (1), pp. 345-358 . https://www.degruyter.com/document/doi/10.1515/jmc-2020-0037/html?lang=en
[16] Franck. Kamwa,and Herve Tale (2021) : Generalization of low rank parity-check (LRPC) codes over the ring of integers modulo a positive integer; In Arabian Journal of Mathematics, Springer (2021) ; Vol. 10 (2), Pages 357-366, https ://doi.org/10.1007/s40065-021-00327- z. . https://link.springer.com/article/10.1007/s40065-021-00327-z
[17] Azebaze G.L.,and El Mrabet N,and Pecha N.A. (2022) Faster Beta Weil Pairing on BLS Pairing Friendly Curves with Odd Embedding Degree., In Mathematics in Computer Science. 16, 13. Springer Birkhäuser (2022). https ://doi.org/10.1007/s11786-022-00531-w . https://www.researchgate.net/publication/361478307_Faster_Beta_Weil_Pairing_on_BLS_Pairing_Friendly_Curves_with_Odd_Embedding_Degree
[18] Nadia El Mrabet,Loubna Ghammam,and Nicolas Meloni (2022) : New Versions of Miller-loop Secured against Side-Channel Attacks; In Arithmetic of Finite Field Springer (2022); Vol. 13638, pp 269-287; https://doi.org/10.1007/978-3-031-22944-2_17 . https://link.springer.com/chapter/10.1007/978-3-031-22944-2_17
[19] Azebaze Guimagang,and Ayissi (2023) : x-Superoptimal Pairings on some Elliptic Curves with Prime Odd Embedding Degrees; In Applicable Algebra in Engineering Communication and Computing, Springer (2023) https ://doi.org/10.1007/s00200-023-00596-5 . https://www.springerprofessional.de/en/x-superoptimal-pairings-on-elliptic-curves-with-odd-prime-embedd/24037336
[20] Senegue Gomez Nyamsi,and Calvin Tcheka (2023) : Faster optimal ate pairings for cyclotomic sparse families of pairing-friendly elliptic curves with embedding degrees 𝑘=5,7; In Discrete Mathematics, Algorithm and Applications. World Scientific (2023) https://doi.org/10.1142/S1793830923500544 . https://www.worldscientific.com/doi/abs/10.1142/S1793830923500544
[21] Fobasso Tchinda Arnaud G,Celestin Nkuimi Jugnia (2023) : A Polynomial Algorithm for Solving the Closest Vector Problem in Tensored Root Lattices of Type D, In SN Computer Science Springer (2023), Vol 4(19) https://doi.org/10.1007/s42979-022-01440-2 . https://link.springer.com/article/10.1007/s42979-022-01440-2
[22] Fobasso Tchinda Arnaud G,and Celestin Nkuimi Jugnia (2023) : Sieve Algorithms for some orthogonal Lattices, In Discrete Mathematics, Algorithm and Applications. World Scientific (2023) https://doi.org/10.1142/S1793830922501518 . https://www.worldscientific.com/doi/abs/10.1142/S1793830922501518?journalCode=dmaa
[23] Kamwa Djomou Franck Rivel,and Tadmon Calvin (2023) : Expanded low-rank parity-check codes and their application to cryptography, In CRYPTOLOGIA, Taylor and Francis (2023) https://doi.org/10.1080/01611194.2023.2202960 . https://www.tandfonline.com/doi/abs/10.1080/01611194.2023.2202960
[24] Hermann Tchatchiem Kamche,and Herve Tale Kalachi,and Kamwa Djomou Franck Rivel (2024) : Low-Rank Parity-Check Codes Over Finite Commutative Rings, Accepted for publication in Applicable Algebra in Engineering, Communication and Computing, Springer, 2024 . https://www.researchgate.net/publication/377221607_Low-rank_parity-check_codes_over_finite_commutative_rings

Selected publications of TALE KALACHI Herve

[1] Gaborit,P.,Otmani,A. (2017) (2017). Polynomial-time key recovery attack on the Faure–Loidreau scheme based on Gabidulin codes. Designs, Codes and Cryptography, 86(7), 1391–1403. https://doi.org/10.1007/s10623-017-0402-0 . https://link.springer.com/article/10.1007/s10623-017-0402-0
[2] Otmani,A.,& Ndjeya (2017) Improved cryptanalysis of rank metric schemes based on Gabidulin codes. Designs, Codes and Cryptography, 86(9), 1983–1996. https://doi.org/10.1007/s10623-017-0434-5 . https://link.springer.com/article/10.1007/s10623-017-0434-5
[3] Dragoi,V. (2018) Cryptanalysis of a Public Key Encryption Scheme Based on QC-LDPC and QCMDPC Codes. IEEE Communications Letters, 22(2), 264–267. https://doi.org/10.1109/lcomm.2017.2779449. . https://www.researchgate.net/publication/321513755_Cryptanalysis_of_a_public_key_encryption_scheme_based_on_QC-LDPC_and_QC-MDPC_codes
[4] (2020) On the failure of the smart approach of the GPT cryptosystem. Cryptologia, 46(2), 167–182. https://doi.org/10.1080/01611194.2020.1829181 . https://www.tandfonline.com/doi/full/10.1080/01611194.2020.1829181
[5] Djomou,F. R. K.,& Fouotsa,E (2021) Generalization of low rank parity-check (LRPC) codes over the ring of integers modulo a positive integer. Arabian Journal of Mathematics, 10(2), 357–366. https://doi.org/10.1007/s40065-021-00327-z . https://link.springer.com/article/10.1007/s40065-021-00327-z
[6] Hermann Tchatchiem Kamche (2023) On the rank decoding problem over finite principal ideal rings. To appear in Advances in Mathematics of Communications, https://doi.org/10.3934/amc.2023003 . https://www.aimsciences.org/article/doi/10.3934/amc.2023003
[7] Hermann Tchatchiem Kamche and Kamwa Djomou Franck Rivel and Emmanuel Fouotsa and Tadmon Calvin (2024) Low-Rank Parity-Check Codes Over Finite Commutative Rings, Accepted for publication in Applicable Algebra in Engineering, Communication and Computing, Springer, 2024 . https://www.researchgate.net/publication/377221607_Low-rank_parity-check_codes_over_finite_commutative_rings

Selected publications of TCHATCHIEM KAMCHE Hermann

[1] C Mouaha (2019) : Rank-metric codes over finite principal ideal rings and applications, In IEEE Transactions on Information Theory, Vol. 65(12) pp. 7718-7735, 2019 . https://ieeexplore.ieee.org/document/8789543
[2] Kalachi,H. T (2023) On the rank decoding problem over finite principal ideal rings. To appear in Advances in Mathematics of Communications, https://doi.org/10.3934/amc.2023003 . https://www.aimsciences.org/article/doi/10.3934/amc.2023003
[3] Herve Tale Kalachi and Kamwa Djomou Franck Rivel and Emmanuel Fouotsa and Tadmon Calvin (2024) Low-Rank Parity-Check Codes Over Finite Commutative Rings, Accepted for publication in Applicable Algebra in Engineering, Communication and Computing, Springer, 2024 . https://www.researchgate.net/publication/377221607_Low-rank_parity-check_codes_over_finite_commutative_rings

Selected publications of Tony Mack Robert EZOME MINTSA

[1] Jean-Marc Couveignes (2023) Jean-Marc Couveignes and Tony Ezome: The equivariant complexity of multiplication in finite fields extensions. Journal of algebra, 622, 694-720 (2023), https://doi.org/10.1016/j.jalgebra.2023.01.022 . https://www.sciencedirect.com/science/article/abs/pii/S0021869323000376
[2] Cornelius Greither (2021) : Minimal Hopf-Galois Structures on Separable Field Extensions. Note di Matematica, 41 (2021), no. 1, 55-67, doi:10.1285/i15900932v41n1 p55 . https://www.researchgate.net/publication/345970947_Minimal_Hopf-Galois_Structures_on_Separable_Field_Extensions
[3] Mohamadou Sall (2020) : On Finite Field Arithmetic in Characterisitc 2. Finite Fields and Their Applications, 68 (2020), 101739, https://doi.org/10.1016/j.!a.2020.101739 . https://www.sciencedirect.com/science/article/abs/pii/S1071579720301088
[4] Mohamadou Sall (2020) Normal bases using 1-dimensional algebraic group. Journal of Symbolic Computation, 101 (2020), 152-169. . https://www.sciencedirect.com/science/article/abs/pii/S0747717119300653
[5] M. Couveignes (2015) Computing functions on Jacobians and their quotients. London Mathematical Society J. Comput. Mat., 18 (2015), no.1, 555-577 . https://www.cambridge.org/core/journals/lms-journal-of-computation-and-mathematics/article/computing-functions-on-jacobians-and-their-quotients/62EF7242B0EE80F554CDC37B87FFA03B

Research publications

Written publications

Selected publications of Boris TAKO FOUOTSA

Selected publications of CHRISTOPHE Petit

Selected publications of FOUOTSA Emmanuel

Selected publications of TALE KALACHI Herve

Selected publications of TCHATCHIEM KAMCHE Hermann

Selected publications of Tony Mack Robert EZOME MINTSA