Gotowa bibliografia na temat „Arithmetization-oriented primitives”
Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych
Spis treści
Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „Arithmetization-oriented primitives”.
Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.
Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.
Artykuły w czasopismach na temat "Arithmetization-oriented primitives"
Ni, Jianqiang, Jianhui Zhang, Gaoli Wang, Rui Li i Yanzhao Shen. "Algebraic Attacks against Grendel: An Arithmetization-Oriented Primitive with the Legendre Symbol". Symmetry 15, nr 8 (10.08.2023): 1563. http://dx.doi.org/10.3390/sym15081563.
Pełny tekst źródłaBoeuf, Aurélien, Anne Canteaut i 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, nr 4 (8.12.2023): 270–98. http://dx.doi.org/10.46586/tosc.v2023.i4.270-298.
Pełny tekst źródłaBariant, Augustin, Clémence Bouvier, Gaëtan Leurent i Léo Perrin. "Algebraic Attacks against Some Arithmetization-Oriented Primitives". IACR Transactions on Symmetric Cryptology, 9.09.2022, 73–101. http://dx.doi.org/10.46586/tosc.v2022.i3.73-101.
Pełny tekst źródłaAly, Abdelrahaman, Tomer Ashur, Eli Ben-Sasson, Siemen Dhooghe i Alan Szepieniec. "Design of Symmetric-Key Primitives for Advanced Cryptographic Protocols". IACR Transactions on Symmetric Cryptology, 28.09.2020, 1–45. http://dx.doi.org/10.46586/tosc.v2020.i3.1-45.
Pełny tekst źródłaRozprawy doktorskie na temat "Arithmetization-oriented primitives"
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.
Pełny tekst źródłaIn recent years, new symmetric cryptographic primitives have been proposed for advanced protocols, like multi-party computation, in combination with a fully homomorphic encryption or in various systems of zero-knowledge proofs. Such protocols are parts of a context marked by the development of cloud and blockchain technologies, and must therefore respond to the growing security concerns of users. These protocols have put forward the need to minimize the number of multiplications performed by the primitive in large finite fields. Classical symmetric algorithms are then inappropriate in this context and the new cryptographic protocols must be combined with symmetric primitives (encryption or hash function) with particular properties. While the number of designs defined over large fields, called "arithmetisation-oriented", is increasing significantly, few cryptanalysis works have been proposed. The first aim of this manuscript is then to contribute to fill this gap, and hence to better understand the specificities of these new objects. We also propose a new vision to design such primitives, covering both aspects of cryptology, the cryptography and the cryptanalysis