Зміст
Добірка наукової літератури з теми "Apprentissage avec erreurs sur les modules"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Apprentissage avec erreurs sur les modules".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Статті в журналах з теми "Apprentissage avec erreurs sur les modules"
Dervaux, A. "Impact d’Internet sur la relation médecin-malade." European Psychiatry 29, S3 (November 2014): 638–39. http://dx.doi.org/10.1016/j.eurpsy.2014.09.161.
Повний текст джерелаPapin, Kevin, and Gabriel Michaud. "Rétroaction corrective synchrone et écriture collaborative en ligne : perceptions d’enseignants de français langue seconde." Canadian Journal of Applied Linguistics 26, no. 2 (August 15, 2023): 60–80. http://dx.doi.org/10.37213/cjal.2023.33027.
Повний текст джерелаKatoozian, Katayoon. "Difficultés des apprenants iraniens du FLE dans la gestion des finales verbales en /E/." ALTERNATIVE FRANCOPHONE 1, no. 9 (February 22, 2016): 171–88. http://dx.doi.org/10.29173/af27042.
Повний текст джерелаDaoud, Mahmoud Adam, and Babiker Mohamed Abdallah. "Didactique de l’oralité dans les universités soudanaises ; état de lieu et perspectives." Journal of Faculty of Education 16, no. 1 (February 28, 2022). http://dx.doi.org/10.53332/jfe.v16i1.786.
Повний текст джерелаVine, Michelle M., Catherine Chiappetta-Swanson, John Maclachlan, Jason J. Brodeur, and Julianne Bagg. "Exploring Local Level Factors Shaping the Implementation of a Blended Learning Module for Information and Geospatial Literacy in Ontario." Canadian Journal for the Scholarship of Teaching and Learning 7, no. 2 (December 11, 2016). http://dx.doi.org/10.5206/cjsotl-rcacea.2016.2.9.
Повний текст джерелаДисертації з теми "Apprentissage avec erreurs sur les modules"
Jeudy, Corentin. "Design of advanced post-quantum signature schemes." Electronic Thesis or Diss., Université de Rennes (2023-....), 2024. http://www.theses.fr/2024URENS018.
Повний текст джерелаThe transition to post-quantum cryptography has been an enormous effort for cryptographers over the last decade. In the meantime, cryptography for the protection of privacy, aiming at addressing the limitations inherent to basic cryptographic mechanisms in this domain, has also attracted a lot of attention. Nevertheless, despite the success of both individual branches, combining both aspects along with practicality turns out to be very challenging. The goal of this thesis then lies in proposing new constructions for practical post-quantum privacy, and more generally advanced authentication mechanisms. To this end, we first focus on the lower level by studying one of the fundamental mathematical assumptions used in lattice-based cryptography: Module Learning With Errors. We show that it does not get significantly easier when stretching the secret and error distributions. We then turn to optimizing preimage samplers which are used in advanced signature designs. Far from being limited to this use case, we show that it also leads to efficient designs of regular signatures. Finally, we use some of the previous contributions to construct so-called signatures with efficient protocols, a versatile building block in countless advanced applications. We showcase it by giving the first post-quantum anonymous credentials, which we implement to demonstrate a theoretical and practical efficiency
Kharchenko, Natalia. "Lattice algorithms and lattice-based cryptography." Electronic Thesis or Diss., Sorbonne université, 2020. http://www.theses.fr/2020SORUS337.
Повний текст джерелаLattice-based cryptography is a field of research that studies the construction of tools for secure communication based on hard lattice problems. Lattice-based cryptography is one of the most promising candidates for secure post-quantum communication. This thesis studies algorithms for solving hard lattice problems and their application to the evaluation of the security of cryptosystems. In the first part, we introduce a new family of lattice sieving algorithms called cylindrical sieving. Heuristic sieving is currently the fastest approach to solve central lattice problems: SVP and CVP. We show that cylindrical sieving can outperform existing sieving algorithms in some cases, namely, that it is more efficient for solving SVP for lattices with small prime volume and for solving the closest vector problem with preprocessing (CVPP). In the second part of the thesis, we improve the dual attack originally used to estimate the security of the Fast Fully Homomorphic Encryption scheme over Torus (TFHE). We hybridize the dual attack with the search for the secret key part. As TFHE uses binary keys, the search part of the attack can be performed efficiently by exploiting the recursive structure of the search space. We compare our attack with other existing techniques for solving LWE and show that the security level of the TFHE scheme should be updated according to the new attack