default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSorina Ionica
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j7]Damien Vidal
, Claire Delaplace, Sorina Ionica:
An analysis of the Crossbred Algorithm for the MQ Problem. IACR Commun. Cryptol. 1(3): 36 (2024)- [j6]Eimear Byrne, Michela Ceria, Sorina Ionica, Relinde P. M. J. Jurrius:
Weighted Subspace Designs from q-Polymatroids. J. Comb. Theory A 201: 105799 (2024) - [i15]Damien Vidal, Sorina Ionica, Claire Delaplace:
The Complexity of the Crossbred Algorithm. IACR Cryptol. ePrint Arch. 2024: 992 (2024) - 2023
- [j5]Eimear Byrne, Michela Ceria, Sorina Ionica, Relinde P. M. J. Jurrius, Elif Saçikara:
Constructions of new matroids and designs over ${\mathbb {F}}_q$. Des. Codes Cryptogr. 91(2): 451-473 (2023) - 2022
- [j4]Bogdan Dina, Sorina Ionica, Jeroen Sijsling:
Isogenous hyperelliptic and non-hyperelliptic Jacobians with maximal complex multiplication. Math. Comput. 92(339): 349-383 (2022) - [c9]Emanuele Bellini, Jorge Chávez-Saab, Jesús-Javier Chi-Domínguez, Andre Esser, Sorina Ionica, Luis Rivera-Zamarripa, Francisco Rodríguez-Henríquez, Monika Trimoska, Floyd Zweydinger:
Parallel Isogeny Path Finding with Limited Memory. INDOCRYPT 2022: 294-316 - [i14]Emanuele Bellini, Jorge Chávez-Saab, Jesús-Javier Chi-Domínguez, Andre Esser, Sorina Ionica, Luis Rivera-Zamarripa, Francisco Rodríguez-Henríquez, Monika Trimoska, Floyd Zweydinger:
Parallel Isogeny Path Finding with Limited Memory. IACR Cryptol. ePrint Arch. 2022: 1464 (2022) - 2021
- [j3]Monika Trimoska, Sorina Ionica, Gilles Dequen:
Time-Memory Analysis of Parallel Collision Search Algorithms. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2021(2): 254-274 (2021) - [c8]Monika Trimoska, Gilles Dequen, Sorina Ionica:
Logical Cryptanalysis with WDSat. SAT 2021: 545-561 - [i13]Sulamithe Tsakou, Sorina Ionica:
Index Calculus Attacks on Hyperelliptic Jacobians with Effective Endomorphisms. IACR Cryptol. ePrint Arch. 2021: 721 (2021) - 2020
- [c7]Monika Trimoska, Sorina Ionica, Gilles Dequen:
A SAT-Based Approach for Index Calculus on Binary Elliptic Curves. AFRICACRYPT 2020: 214-235 - [c6]Monika Trimoska, Sorina Ionica, Gilles Dequen:
Parity (XOR) Reasoning for the Index Calculus Attack. CP 2020: 774-790 - [i12]Monika Trimoska, Sorina Ionica, Gilles Dequen:
Parity (XOR) Reasoning for the Index Calculus Attack. CoRR abs/2001.11229 (2020)
2010 – 2019
- 2019
- [i11]Monika Trimoska, Sorina Ionica, Gilles Dequen:
A SAT-based approach for index calculus on binary elliptic curves. IACR Cryptol. ePrint Arch. 2019: 313 (2019) - 2017
- [i10]Gilles Dequen, Sorina Ionica, Monika Trimoska:
Parallel Collision Search with Radix Trees. IACR Cryptol. ePrint Arch. 2017: 581 (2017) - 2016
- [j2]Jennifer S. Balakrishnan, Sorina Ionica, Kristin E. Lauter, Christelle Vincent:
Constructing genus-3 hyperelliptic Jacobians with CM. LMS J. Comput. Math. 19(A): 283-300 (2016) - [i9]Jennifer S. Balakrishnan, Sorina Ionica, Kristin E. Lauter, Christelle Vincent:
Constructing genus 3 hyperelliptic Jacobians with CM. IACR Cryptol. ePrint Arch. 2016: 328 (2016) - 2014
- [i8]Sorina Ionica, Emmanuel Thomé:
Isogeny graphs with maximal real multiplication. IACR Cryptol. ePrint Arch. 2014: 230 (2014) - [i7]Sorina Ionica, Malika Izabachène:
Weak instances of composite order protocols. IACR Cryptol. ePrint Arch. 2014: 274 (2014) - 2013
- [j1]Sorina Ionica, Antoine Joux:
Pairing the volcano. Math. Comput. 82(281): 581-603 (2013) - [c5]Aurore Guillevic, Sorina Ionica:
Four-Dimensional GLV via the Weil Restriction. ASIACRYPT (1) 2013: 79-96 - [i6]Aurore Guillevic, Sorina Ionica:
Four dimensional GLV via the Weil restriction. IACR Cryptol. ePrint Arch. 2013: 311 (2013) - 2012
- [i5]Sorina Ionica:
Pairing-based algorithms for jacobians of genus 2 curves with maximal endomorphism ring. CoRR abs/1204.0222 (2012) - [i4]Sorina Ionica:
Pairing-based algorithms for jacobians of genus 2 curves with maximal endomorphism ring. IACR Cryptol. ePrint Arch. 2012: 167 (2012) - 2011
- [c4]Nadia El Mrabet, Aurore Guillevic, Sorina Ionica:
Efficient Multiplication in Finite Field Extensions of Degree 5. AFRICACRYPT 2011: 188-205 - 2010
- [c3]Sorina Ionica, Antoine Joux:
Pairing the Volcano. ANTS 2010: 201-218 - [c2]Sorina Ionica, Antoine Joux:
Pairing Computation on Elliptic Curves with Efficiently Computable Endomorphism and Small Embedding Degree. Pairing 2010: 435-449 - [i3]Sorina Ionica, Antoine Joux:
Pairing computation on elliptic curves with efficiently computable endomorphism and small embedding degree. IACR Cryptol. ePrint Arch. 2010: 379 (2010)
2000 – 2009
- 2009
- [i2]Nadia El Mrabet, Nicolas Guillermin, Sorina Ionica:
A study of pairing computation for elliptic curves with embedding degree 15. IACR Cryptol. ePrint Arch. 2009: 370 (2009) - 2008
- [c1]Sorina Ionica, Antoine Joux:
Another Approach to Pairing Computation in Edwards Coordinates. INDOCRYPT 2008: 400-413 - [i1]Sorina Ionica, Antoine Joux:
Another approach to pairing computation in Edwards coordinates. IACR Cryptol. ePrint Arch. 2008: 292 (2008)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:17 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
