Opendata, web and dolomites


Algebraic Methods for Stronger Crypto

Total Cost €


EC-Contrib. €






 ALGSTRONGCRYPTO project word cloud

Explore the words cloud of the ALGSTRONGCRYPTO project. It provides you a very rough idea of what is the project "ALGSTRONGCRYPTO" about.

wise    widen    foundational    arithmetical    code    asymptotic    theory    symmetries    completely    generation    degree    finite    primitive    subdivided    dimensional    play    error    algebras    simulating    theoretic    cryptanalysis    primitives    last    perspectives    our    builds    frontiers    crypto    complexity    besides    party    computational    geometry    captured    connections    utility    efficiency    scope    computation    secure    constant    thereof    space    algebraic    theoretical    deepening    codices    concretely    broadening    fundamental    public    localities    combinatorics    security    modules    generally    communication    enjoys    cryptographic    basic    coordinate    cryptology    linear    structures    endowing    significantly    viewed    construction    simulation    relies    powerful    surprising    cryptography    strengthen    overarching    arithmetic    ways    least    ambient    adversaries    holds    multiplication    interconnected    wish    lens    vector    codex    foundations    rate    correcting    abstract   

Project "ALGSTRONGCRYPTO" data sheet

The following table provides information about the project.


There are not information about this coordinator. Please contact Fabio for more information, thanks.

 Coordinator Country Netherlands [NL]
 Total cost 2˙447˙439 €
 EC max contribution 2˙447˙439 € (100%)
 Programme 1. H2020-EU.1.1. (EXCELLENT SCIENCE - European Research Council (ERC))
 Code Call ERC-2016-ADG
 Funding Scheme ERC-ADG
 Starting year 2017
 Duration (year-month-day) from 2017-10-01   to  2022-09-30


Take a look of project's partnership.

# participants  country  role  EC contrib. [€] 


 Project objective

Our field is cryptology. Our overarching objective is to advance significantly the frontiers in design and analysis of high-security cryptography for the future generation. Particularly, we wish to enhance the efficiency, functionality, and, last-but-not-least, fundamental understanding of cryptographic security against very powerful adversaries. Our approach here is to develop completely novel methods by deepening, strengthening and broadening the algebraic foundations of the field. Concretely, our lens builds on the arithmetic codex. This is a general, abstract cryptographic primitive whose basic theory we recently developed and whose asymptotic part, which relies on algebraic geometry, enjoys crucial applications in surprising foundational results on constant communication-rate two-party cryptography. A codex is a linear (error correcting) code that, when endowing its ambient vector space just with coordinate-wise multiplication, can be viewed as simulating, up to some degree, richer arithmetical structures such as finite fields (or products thereof), or generally, finite-dimensional algebras over finite fields. Besides this degree, coordinate-localities for which simulation holds and for which it does not at all are also captured. Our method is based on novel perspectives on codices which significantly widen their scope and strengthen their utility. Particularly, we bring symmetries, computational- and complexity theoretic aspects, and connections with algebraic number theory, -geometry, and -combinatorics into play in novel ways. Our applications range from public-key cryptography to secure multi-party computation. Our proposal is subdivided into 3 interconnected modules:

(1) Algebraic- and Number Theoretical Cryptanalysis (2) Construction of Algebraic Crypto Primitives (3) Advanced Theory of Arithmetic Codices


year authors and title journal last update
List of publications.
2019 Serge Fehr, Chen Yuan
Towards optimal robust secret sharing with security against a rushing adversary
published pages: 472-499 |, ISSN: , DOI:
Advances in Cryptology - EUROCRYPT 2019 38th Annual 2019-09-04
2018 Ronald Crame, Ivan Damgård, Daniel Escudero, Peter Scholl, Chaoping Xing
SPDZ2k: Efficient MPC mod 2^k for Dishonest Majority
published pages: 769-798, ISSN: , DOI:
Advances in Cryptology – CRYPTO 2018 38th Annual 2019-09-04
2019 Shu Liu, Chaoping Xing, Chen Yuan
List Decodability of Symbol-Pair Codes
published pages: 1-1, ISSN: 0018-9448, DOI: 10.1109/tit.2019.2904998
IEEE Transactions on Information Theory 14 March 2019 2019-09-04
2019 Chaoping Xing, Chen Yuan
Construction of optimal locally recoverable codes and connection with hypergraph
published pages: , ISSN: , DOI:
ICALP 2019 46th Annual 2019-09-04
2019 Léo Ducas, Maxime Plançon, Benjamin Wesolowski
On the Shortness of Vectors to be found by the Ideal-SVP Quantum Algorithm
published pages: , ISSN: , DOI:
Advances in Cryptology - CRYPTO 2019 39th Annual 2019-09-04
2019 Benjamin Wesolowski
Efficient verifiable delay functions
published pages: 379-407, ISSN: , DOI:
Advances in Cryptology – EUROCRYPT 2019 38th Annual 2019-09-04
2018 Ignacio Cascudo, Ronald Cramer, Chaoping Xing, Chen Yuan
Amortized Complexity of Information-Theoretically Secure MPC Revisited
published pages: 395-426, ISSN: , DOI:
Advances in Cryptology – CRYPTO 2018 38th Annual 2019-09-04
2018 Koen de Boer, Léo Ducas, Stacey Jeffery, Ronald de Wolf
Attacks on the AJPS Mersenne-based cryptosystem
published pages: 101-120, ISSN: , DOI:
PQCRYPTO 2018 8th Annual 2019-09-04
2019 Venkatesan Guruswami, Chaoping Xing, Chen Yuan
How Long Can Optimal Locally Repairable Codes Be?
published pages: 3662-3670, ISSN: 0018-9448, DOI: 10.1109/tit.2019.2891765
IEEE Transactions on Information Theory 65/6 2019-09-04
2019 Yuan Luo, Chaoping Xing, Chen Yuan
Optimal locally repairable codes of distance 3 and 4 via cyclic codes
published pages: 1048 - 1053, ISSN: 0018-9448, DOI:
IEEE Transactions on Information Theory Volume: 65 , Issue: 2 , Feb. 20 2019-09-04
2019 Jelle Don, Serge Fehr, Christian Majenz, Christian Schaffner
Security of the Fiat-Shamir Transformation in the Quantum Random-Oracle Model
published pages: , ISSN: , DOI:
Advances in Cryptology - CRYPTO 2019 39th Annual 2019-09-04
2018 Venkatesan Guruswami, Chaoping Xing, Chen Yuan
Subspace Designs based on Algebraic Function Fields
published pages: 8757-8775, ISSN: 0002-9947, DOI:
Transactions of the American Mathematical Society 370 (2018) 2019-09-04

Are you the coordinator (or a participant) of this project? Plaese send me more information about the "ALGSTRONGCRYPTO" project.

For instance: the website url (it has not provided by EU-opendata yet), the logo, a more detailed description of the project (in plain text as a rtf file or a word file), some pictures (as picture files, not embedded into any word file), twitter account, linkedin page, etc.

Send me an  email ( and I put them in your project's page as son as possible.

Thanks. And then put a link of this page into your project's website.

The information about "ALGSTRONGCRYPTO" are provided by the European Opendata Portal: CORDIS opendata.

More projects from the same programme (H2020-EU.1.1.)

VictPart (2019)

Righting Victim Participation in Transitional Justice

Read More  

Photopharm (2020)

Photopharmacology: From Academia toward the Clinic.

Read More  


The Enemy of the Good: Towards a Theory of Moral Progress

Read More