Literatura científica selecionada sobre o tema "Arithmetization-oriented primitives"
Crie uma referência precisa em APA, MLA, Chicago, Harvard, e outros estilos
Consulte a lista de atuais artigos, livros, teses, anais de congressos e outras fontes científicas relevantes para o tema "Arithmetization-oriented primitives".
Ao lado de cada fonte na lista de referências, há um botão "Adicionar à bibliografia". Clique e geraremos automaticamente a citação bibliográfica do trabalho escolhido no estilo de citação de que você precisa: APA, MLA, Harvard, Chicago, Vancouver, etc.
Você também pode baixar o texto completo da publicação científica em formato .pdf e ler o resumo do trabalho online se estiver presente nos metadados.
Artigos de revistas sobre o assunto "Arithmetization-oriented primitives"
Ni, Jianqiang, Jianhui Zhang, Gaoli Wang, Rui Li e Yanzhao Shen. "Algebraic Attacks against Grendel: An Arithmetization-Oriented Primitive with the Legendre Symbol". Symmetry 15, n.º 8 (10 de agosto de 2023): 1563. http://dx.doi.org/10.3390/sym15081563.
Texto completo da fonteBoeuf, Aurélien, Anne Canteaut e 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, n.º 4 (8 de dezembro de 2023): 270–98. http://dx.doi.org/10.46586/tosc.v2023.i4.270-298.
Texto completo da fonteBariant, Augustin, Clémence Bouvier, Gaëtan Leurent e Léo Perrin. "Algebraic Attacks against Some Arithmetization-Oriented Primitives". IACR Transactions on Symmetric Cryptology, 9 de setembro de 2022, 73–101. http://dx.doi.org/10.46586/tosc.v2022.i3.73-101.
Texto completo da fonteAly, Abdelrahaman, Tomer Ashur, Eli Ben-Sasson, Siemen Dhooghe e Alan Szepieniec. "Design of Symmetric-Key Primitives for Advanced Cryptographic Protocols". IACR Transactions on Symmetric Cryptology, 28 de setembro de 2020, 1–45. http://dx.doi.org/10.46586/tosc.v2020.i3.1-45.
Texto completo da fonteTeses / dissertações sobre o assunto "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.
Texto completo da fonteIn 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