Sorina Ionica

Orcid: 0000-0003-4038-454X

According to our database1, Sorina Ionica authored at least 22 papers between 2008 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Weighted Subspace Designs from <i>q</i>-Polymatroids.
J. Comb. Theory A, January, 2024

The Complexity of the Crossbred Algorithm.
IACR Cryptol. ePrint Arch., 2024

An analysis of the Crossbred Algorithm for the MQ Problem.
IACR Commun. Cryptol., 2024

2023
Constructions of new matroids and designs over ${\mathbb {F}}_q$.
Des. Codes Cryptogr., February, 2023

2022
Isogenous hyperelliptic and non-hyperelliptic Jacobians with maximal complex multiplication.
Math. Comput., September, 2022

Parallel Isogeny Path Finding with Limited Memory.
Proceedings of the Progress in Cryptology - INDOCRYPT 2022, 2022

2021
Time-Memory Analysis of Parallel Collision Search Algorithms.
IACR Trans. Cryptogr. Hardw. Embed. Syst., 2021

Index Calculus Attacks on Hyperelliptic Jacobians with Effective Endomorphisms.
IACR Cryptol. ePrint Arch., 2021

Logical Cryptanalysis with WDSat.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2021, 2021

2020
Parity (XOR) Reasoning for the Index Calculus Attack.
Proceedings of the Principles and Practice of Constraint Programming, 2020

A SAT-Based Approach for Index Calculus on Binary Elliptic Curves.
Proceedings of the Progress in Cryptology - AFRICACRYPT 2020, 2020

2017
Parallel Collision Search with Radix Trees.
IACR Cryptol. ePrint Arch., 2017

2016
Constructing genus-3 hyperelliptic Jacobians with CM.
LMS J. Comput. Math., 2016

2014
Isogeny graphs with maximal real multiplication.
IACR Cryptol. ePrint Arch., 2014

Weak instances of composite order protocols.
IACR Cryptol. ePrint Arch., 2014

2013
Four-Dimensional GLV via the Weil Restriction.
Proceedings of the Advances in Cryptology - ASIACRYPT 2013, 2013

2012
Pairing-based algorithms for jacobians of genus 2 curves with maximal endomorphism ring.
IACR Cryptol. ePrint Arch., 2012

2011
Efficient Multiplication in Finite Field Extensions of Degree 5.
Proceedings of the Progress in Cryptology - AFRICACRYPT 2011, 2011

2010
Pairing Computation on Elliptic Curves with Efficiently Computable Endomorphism and Small Embedding Degree.
Proceedings of the Pairing-Based Cryptography - Pairing 2010, 2010

Pairing the Volcano.
Proceedings of the Algorithmic Number Theory, 9th International Symposium, 2010

2009
A study of pairing computation for elliptic curves with embedding degree 15.
IACR Cryptol. ePrint Arch., 2009

2008
Another Approach to Pairing Computation in Edwards Coordinates.
Proceedings of the Progress in Cryptology, 2008


  Loading...