Gotowa bibliografia na temat „Algorithmes de sieving”
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 „Algorithmes de sieving”.
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 "Algorithmes de sieving"
Bai, Shi, Thijs Laarhoven i Damien Stehlé. "Tuple lattice sieving". LMS Journal of Computation and Mathematics 19, A (2016): 146–62. http://dx.doi.org/10.1112/s1461157016000292.
Pełny tekst źródłaMukhopadhyay, Priyanka. "Faster Provable Sieving Algorithms for the Shortest Vector Problem and the Closest Vector Problem on Lattices in ℓp Norm". Algorithms 14, nr 12 (13.12.2021): 362. http://dx.doi.org/10.3390/a14120362.
Pełny tekst źródłaGrémy, Laurent. "Higher-dimensional sieving for the number field sieve algorithms". Open Book Series 2, nr 1 (28.01.2019): 275–91. http://dx.doi.org/10.2140/obs.2019.2.275.
Pełny tekst źródłaSatılmış, Hami, Sedat Akleylek i Cheng-Chi Lee. "Efficient Implementations of Sieving and Enumeration Algorithms for Lattice-Based Cryptography". Mathematics 9, nr 14 (8.07.2021): 1618. http://dx.doi.org/10.3390/math9141618.
Pełny tekst źródłaShi, Wenhao, Haodong Jiang i Zhi Ma. "Solving HNP with One Bit Leakage: An Asymmetric Lattice Sieving Algorithm". Entropy 25, nr 1 (27.12.2022): 49. http://dx.doi.org/10.3390/e25010049.
Pełny tekst źródłaSengupta, Binanda, i Abhijit Das. "Use of SIMD-based data parallelism to speed up sieving in integer-factoring algorithms". Applied Mathematics and Computation 293 (styczeń 2017): 204–17. http://dx.doi.org/10.1016/j.amc.2016.08.019.
Pełny tekst źródłaBudroni, Alessandro, Qian Guo, Thomas Johansson, Erik Mårtensson i Paul Stankovski Wagner. "Improvements on Making BKW Practical for Solving LWE". Cryptography 5, nr 4 (28.10.2021): 31. http://dx.doi.org/10.3390/cryptography5040031.
Pełny tekst źródłaPurinton, Benjamin, i Bodo Bookhagen. "Introducing <i>PebbleCounts</i>: a grain-sizing tool for photo surveys of dynamic gravel-bed rivers". Earth Surface Dynamics 7, nr 3 (17.09.2019): 859–77. http://dx.doi.org/10.5194/esurf-7-859-2019.
Pełny tekst źródłaWang, Shouhua, Shuaihu Wang i Xiyan Sun. "A Multi-Scale Anti-Multipath Algorithm for GNSS-RTK Monitoring Application". Sensors 23, nr 20 (11.10.2023): 8396. http://dx.doi.org/10.3390/s23208396.
Pełny tekst źródłaNowak, Damian, Rafał Adam Bachorz i Marcin Hoffmann. "Neural Networks in the Design of Molecules with Affinity to Selected Protein Domains". International Journal of Molecular Sciences 24, nr 2 (16.01.2023): 1762. http://dx.doi.org/10.3390/ijms24021762.
Pełny tekst źródłaRozprawy doktorskie na temat "Algorithmes de sieving"
Kharchenko, Natalia. "Lattice algorithms and lattice-based cryptography". Electronic Thesis or Diss., Sorbonne université, 2020. http://www.theses.fr/2020SORUS337.
Pełny tekst źródłaLattice-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
Guo, Hong L. "Sieving of spherical particles during gel electrophoresis: A new computer simulation algorithm". Thesis, University of Ottawa (Canada), 1994. http://hdl.handle.net/10393/6741.
Pełny tekst źródłaKsiążki na temat "Algorithmes de sieving"
Kockelman, Paul. Algorithms, Agents, and Ontologies. Oxford University Press, 2017. http://dx.doi.org/10.1093/acprof:oso/9780190636531.003.0007.
Pełny tekst źródłaCzęści książek na temat "Algorithmes de sieving"
Eiben, Eduard, Tomohiro Koana i Magnus Wahlström. "Determinantal Sieving". W Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 377–423. Philadelphia, PA: Society for Industrial and Applied Mathematics, 2024. http://dx.doi.org/10.1137/1.9781611977912.16.
Pełny tekst źródłaBuchmann, Johannes, Michael J. Jacobson, Stefan Neis, Patrick Theobald i Damian Weber. "Sieving Methods for Class Group Computation". W Algorithmic Algebra and Number Theory, 3–10. Berlin, Heidelberg: Springer Berlin Heidelberg, 1999. http://dx.doi.org/10.1007/978-3-642-59932-3_1.
Pełny tekst źródłaAndrzejczak, Michal, i Kris Gaj. "A Multiplatform Parallel Approach for Lattice Sieving Algorithms". W Algorithms and Architectures for Parallel Processing, 661–80. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-60245-1_45.
Pełny tekst źródłaSengupta, Binanda, i Abhijit Das. "SIMD-Based Implementations of Sieving in Integer-Factoring Algorithms". W Security, Privacy, and Applied Cryptography Engineering, 40–55. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-41224-0_4.
Pełny tekst źródłaDucas, Léo. "Estimating the Hidden Overheads in the BDGL Lattice Sieving Algorithm". W Post-Quantum Cryptography, 480–97. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-17234-2_22.
Pełny tekst źródłaDeng, Xixuan, i Huiwen Jia. "A New Self-dual BKZ Algorithm Based on Lattice Sieving". W Communications in Computer and Information Science, 323–36. Singapore: Springer Nature Singapore, 2024. http://dx.doi.org/10.1007/978-981-99-9331-4_22.
Pełny tekst źródłaWang, Ping, i Dongdong Shang. "A New Lattice Sieving Algorithm Base on Angular Locality-Sensitive Hashing". W Information Security and Cryptology, 65–80. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-75160-3_6.
Pełny tekst źródłaMcCoy, Hunter, Steven Hofmey, Katherine Yelick i Prashant Pandey. "Singleton Sieving: Overcoming the Memory/Speed Trade-Off in Exascale κ-mer Analysis". W SIAM Conference on Applied and Computational Discrete Algorithms (ACDA23), 213–24. Philadelphia, PA: Society for Industrial and Applied Mathematics, 2023. http://dx.doi.org/10.1137/1.9781611977714.19.
Pełny tekst źródłaDadush, Daniel. "A O(1/ε 2) n -Time Sieving Algorithm for Approximate Integer Programming". W LATIN 2012: Theoretical Informatics, 207–18. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-29344-3_18.
Pełny tekst źródłaKirshanova, Elena, Erik Mårtensson, Eamonn W. Postlethwaite i Subhayan Roy Moulik. "Quantum Algorithms for the Approximate k-List Problem and Their Application to Lattice Sieving". W Lecture Notes in Computer Science, 521–51. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-34578-5_19.
Pełny tekst źródłaStreszczenia konferencji na temat "Algorithmes de sieving"
Laarhoven, Thijs. "Evolutionary Techniques in Lattice Sieving Algorithms". W 11th International Conference on Evolutionary Computation Theory and Applications. SCITEPRESS - Science and Technology Publications, 2019. http://dx.doi.org/10.5220/0007968800310039.
Pełny tekst źródłaSatilmis, Hami, i Sedat Akleylek. "Efficient Implementations of Gauss-Based Sieving Algorithms". W 2020 28th Signal Processing and Communications Applications Conference (SIU). IEEE, 2020. http://dx.doi.org/10.1109/siu49456.2020.9302189.
Pełny tekst źródłaBecker, Anja, Léo Ducas, Nicolas Gama i Thijs Laarhoven. "New directions in nearest neighbor searching with applications to lattice sieving". W Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms. Philadelphia, PA: Society for Industrial and Applied Mathematics, 2015. http://dx.doi.org/10.1137/1.9781611974331.ch2.
Pełny tekst źródłaSickory Daisy, S. Jancy, i A. Rijuvana Begum. "Email Spam Behavioral Sieving Technique using Hybrid Algorithm". W 2023 7th International Conference on I-SMAC (IoT in Social, Mobile, Analytics and Cloud) (I-SMAC). IEEE, 2023. http://dx.doi.org/10.1109/i-smac58438.2023.10290527.
Pełny tekst źródłaDu, Wenna, Hongqiang Lin i Zehua Chen. "A Parallel Granular Sieving Algorithm for Global Optimization". W 2022 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology (WI-IAT). IEEE, 2022. http://dx.doi.org/10.1109/wi-iat55865.2022.00136.
Pełny tekst źródłaAkleylek, Sedat, i Hami Satilmis. "Parameter Estimation for Lattice-Based Cryptosystems By Using Sieving Algorithms". W 2019 4th International Conference on Computer Science and Engineering (UBMK). IEEE, 2019. http://dx.doi.org/10.1109/ubmk.2019.8907018.
Pełny tekst źródłaMariano, Artur, Christian Bischof i Thijs Laarhoven. "Parallel (Probable) Lock-Free Hash Sieve: A Practical Sieving Algorithm for the SVP". W 2015 44th International Conference on Parallel Processing (ICPP). IEEE, 2015. http://dx.doi.org/10.1109/icpp.2015.68.
Pełny tekst źródłaJerdhaf, Oskar, Marina Santini, Peter Lundberg, Anette Karlsson i Arne Jönsson. "Implant Term Extraction from Swedish Medical Records – Phase 1: Lessons Learned". W Eighth Swedish Language Technology Conference (SLTC-2020), 25-27 November 2020. Linköping University Electronic Press, 2021. http://dx.doi.org/10.3384/ecp184173.
Pełny tekst źródła