Relevant bibliographies by topics / Arithmetization-oriented primitives

Contents

  1. Journal articles
  2. Dissertations / Theses

Academic literature on the topic 'Arithmetization-oriented primitives'

Author: Grafiati
Published: 25 May 2024

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Arithmetization-oriented primitives.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Arithmetization-oriented primitives"

1

Ni, Jianqiang, Jianhui Zhang, Gaoli Wang, Rui Li, and Yanzhao Shen. "Algebraic Attacks against Grendel: An Arithmetization-Oriented Primitive with the Legendre Symbol." Symmetry 15, no. 8 (2023): 1563. http://dx.doi.org/10.3390/sym15081563.

Full text
Abstract:
The rise of modern cryptographic protocols such as Zero-Knowledge proofs and secure Multi-party Computation has led to an increased demand for a new class of symmetric primitives. Unlike traditional platforms such as servers, microcontrollers, and desktop computers, these primitives are designed to be implemented in arithmetical circuits. In terms of security evaluation, arithmetization-oriented primitives are more complex compared to traditional symmetric cryptographic primitives. The arithmetization-oriented permutation Grendel employs the Legendre Symbol to increase the growth of algebraic
APA, Harvard, Vancouver, ISO, and other styles
2

Boeuf, Aurélien, Anne Canteaut, and Léo Perrin. "Propagation of Subspaces in Primitives with Monomial Sboxes: Applications to Rescue and Variants of the AES." IACR Transactions on Symmetric Cryptology 2023, no. 4 (2023): 270–98. http://dx.doi.org/10.46586/tosc.v2023.i4.270-298.

Full text
Abstract:
Motivated by progress in the field of zero-knowledge proofs, so-called Arithmetization-Oriented (AO) symmetric primitives have started to appear in the literature, such as MiMC, Poseidon or Rescue. Due to the design constraints implied by this setting, these algorithms are defined using simple operations over large (possibly prime) fields. In particular, many rely on simple low-degree monomials for their non-linear layers, essentially using x ↦ x3 as an S-box.In this paper, we show that the structure of the material injected in each round (be it subkeys in a block cipher or round constants in
APA, Harvard, Vancouver, ISO, and other styles
3

Bariant, Augustin, Clémence Bouvier, Gaëtan Leurent, and Léo Perrin. "Algebraic Attacks against Some Arithmetization-Oriented Primitives." IACR Transactions on Symmetric Cryptology, September 9, 2022, 73–101. http://dx.doi.org/10.46586/tosc.v2022.i3.73-101.

Full text
Abstract:
Recent advanced Zero-Knowledge protocols, along with other high-level constructions such as Multi-Party Computations (MPC), have highlighted the need for a new type of symmetric primitives that are not optimized for speed on the usual platforms (desktop computers, servers, microcontrollers, RFID tags...), but for their ability to be implemented using arithmetic circuits.Several primitives have already been proposed to satisfy this need. In order to enable an efficient arithmetization, they operate over large finite fields, and use round functions that can be modelled using low degree equations
APA, Harvard, Vancouver, ISO, and other styles
4

Aly, Abdelrahaman, Tomer Ashur, Eli Ben-Sasson, Siemen Dhooghe, and Alan Szepieniec. "Design of Symmetric-Key Primitives for Advanced Cryptographic Protocols." IACR Transactions on Symmetric Cryptology, September 28, 2020, 1–45. http://dx.doi.org/10.46586/tosc.v2020.i3.1-45.

Full text
Abstract:
While traditional symmetric algorithms like AES and SHA-3 are optimized for efficient hardware and software implementations, a range of emerging applications using advanced cryptographic protocols such as multi-party computation and zero knowledge proofs require optimization with respect to a different metric: arithmetic complexity.In this paper we study the design of secure cryptographic algorithms optimized to minimize this metric. We begin by identifying the differences in the design space between such arithmetization-oriented ciphers and traditional ones, with particular emphasis on the av
APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Arithmetization-oriented primitives"

1

Bouvier, Clémence. "Cryptanalysis and design of symmetric primitives defined over large finite fields." Electronic Thesis or Diss., Sorbonne université, 2023. http://www.theses.fr/2023SORUS367.

Full text
Abstract:
Ces dernières années, de nouvelles primitives de cryptographie symétrique ont été proposées pour être utilisées dans des protocoles avancés comme le calcul multi-partite, en combinaison avec un chiffrement homomorphe ou encore dans divers systèmes de preuve à apport nul de connaissance. De tels protocoles s’inscrivent dans un contexte marqué par le développement du Cloud et des technologies de type Blockchain et doivent ainsi répondre à une préoccupation croissante des utilisateurs en matière de sécurité. Ces protocoles ont mis en avant le besoin de minimiser le nombre de multiplications effec
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography