Auswahl der wissenschaftlichen Literatur zum Thema „Arithmetization-Oriented“
Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an
Inhaltsverzeichnis
Machen Sie sich mit den Listen der aktuellen Artikel, Bücher, Dissertationen, Berichten und anderer wissenschaftlichen Quellen zum Thema "Arithmetization-Oriented" bekannt.
Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.
Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.
Zeitschriftenartikel zum Thema "Arithmetization-Oriented"
Li, Zhengnan, Baofeng Wu und Dongdai Lin. „Algebraic-Differential Attacks on a Family of Arithmetization-Oriented Symmetric Ciphers“. Journal of Systems Science and Complexity 36, Nr. 6 (Dezember 2023): 2681–702. http://dx.doi.org/10.1007/s11424-023-1511-7.
Der volle Inhalt der QuelleNi, Jianqiang, Jianhui Zhang, Gaoli Wang, Rui Li und 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.
Der volle Inhalt der QuelleGrassi, Lorenzo, Dmitry Khovratovich, Reinhard Lüftenegger, Christian Rechberger, Markus Schofnegger und Roman Walch. „Monolith: Circuit-Friendly Hash Functions with New Nonlinear Layers for Fast and Constant-Time Implementations“. IACR Transactions on Symmetric Cryptology 2024, Nr. 3 (06.09.2024): 44–83. http://dx.doi.org/10.46586/tosc.v2024.i3.44-83.
Der volle Inhalt der QuelleSteiner, Matthias Johann. „Solving Degree Bounds for Iterated Polynomial Systems“. IACR Transactions on Symmetric Cryptology 2024, Nr. 1 (01.03.2024): 357–411. http://dx.doi.org/10.46586/tosc.v2024.i1.357-411.
Der volle Inhalt der QuelleBoeuf, Aurélien, Anne Canteaut und 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 (08.12.2023): 270–98. http://dx.doi.org/10.46586/tosc.v2023.i4.270-298.
Der volle Inhalt der QuelleBudaghyan, Lilya, und Mohit Pal. „Arithmetization-oriented APN permutations“. Designs, Codes and Cryptography, 18.09.2024. http://dx.doi.org/10.1007/s10623-024-01487-7.
Der volle Inhalt der QuelleBariant, Augustin, Clémence Bouvier, Gaëtan Leurent und Léo Perrin. „Algebraic Attacks against Some Arithmetization-Oriented Primitives“. IACR Transactions on Symmetric Cryptology, 09.09.2022, 73–101. http://dx.doi.org/10.46586/tosc.v2022.i3.73-101.
Der volle Inhalt der QuelleAly, Abdelrahaman, Tomer Ashur, Eli Ben-Sasson, Siemen Dhooghe und 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.
Der volle Inhalt der QuelleDissertationen zum Thema "Arithmetization-Oriented"
Bariant, Augustin. „Analysis of AES-based and arithmetization-oriented symmetric cryptography primitives“. Electronic Thesis or Diss., Sorbonne université, 2024. https://accesdistant.sorbonne-universite.fr/login?url=https://theses-intra.sorbonne-universite.fr/2024SORUS182.pdf.
Der volle Inhalt der QuelleCryptography plays a critical role in digital communication, by ensuring that malicious users cannot obtain sensitive information that do not belong to them. In symmetric cryptography, two parties agree on a secret key, and use a cipher to encrypt their communication, the most used of which being AES. However, the security of symmetric ciphers is not mathematically provable, therefore a lot of effort needs to be dedicated to cryptanalysis, i.e. the search for the best attacks.In this context, this thesis improves on some cryptanalysis techniques against AES-based ciphers. First, we present an attack on full ForkAES, together with an improved impossible differential attack on ForkSkinny. Second, we show some new boomerang attacks on 6-round AES and on several AES-based ciphers. In particular, we introduce a new boomerang attack framework, the truncated boomerang attack, that yields the best known attacks against Kiasu-BC, Deoxys-BC and TNT-AES.We also present an AES-based universal hash function framework, from which we design two AES-based MACs, LeMac and PetitMac. LeMac offers the best software performance among existing MAC algorithms on recent desktop CPUs.We finally study algebraic attacks against a new generation of symmetric primitives, called Arithmetization-Oriented (AO). We show that these attacks can be improved with symmetric techniques, and highlight that univariate attacks are much cheaper than multivariate attacks. We also present the FreeLunch attack, a new type of algebraic attack that challenges the security of several recent AO 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.
Der volle Inhalt der QuelleIn 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
Buchteile zum Thema "Arithmetization-Oriented"
Bariant, Augustin, Aurélien Boeuf, Axel Lemoine, Irati Manterola Ayala, Morten Øygarden, Léo Perrin und Håvard Raddum. „The Algebraic FreeLunch: Efficient Gröbner Basis Attacks Against Arithmetization-Oriented Primitives“. In Lecture Notes in Computer Science, 139–73. Cham: Springer Nature Switzerland, 2024. http://dx.doi.org/10.1007/978-3-031-68385-5_5.
Der volle Inhalt der QuelleBouvier, Clémence, Pierre Briaud, Pyrros Chaidos, Léo Perrin, Robin Salen, Vesselin Velichkov und Danny Willems. „New Design Techniques for Efficient Arithmetization-Oriented Hash Functions: $$\texttt{Anemoi}$$ Permutations and $$\texttt{Jive}$$ Compression Mode“. In Advances in Cryptology – CRYPTO 2023, 507–39. Cham: Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-38548-3_17.
Der volle Inhalt der QuelleKonferenzberichte zum Thema "Arithmetization-Oriented"
Andreeva, Elena, Rishiraj Bhattacharyya, Arnab Roy und Stefano Trevisani. „On Efficient and Secure Compression Functions for Arithmetization-Oriented Hashing“. In 2024 IEEE 37th Computer Security Foundations Symposium (CSF), 1–16. IEEE, 2024. http://dx.doi.org/10.1109/csf61375.2024.00045.
Der volle Inhalt der Quelle