Auswahl der wissenschaftlichen Literatur zum Thema „Sieving algorithms“
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 "Sieving algorithms" 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 "Sieving algorithms"
Bai, Shi, Thijs Laarhoven und Damien Stehlé. „Tuple lattice sieving“. LMS Journal of Computation and Mathematics 19, A (2016): 146–62. http://dx.doi.org/10.1112/s1461157016000292.
Der volle Inhalt der QuelleMukhopadhyay, 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.
Der volle Inhalt der QuelleShi, Wenhao, Haodong Jiang und 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.
Der volle Inhalt der QuelleGré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.
Der volle Inhalt der QuelleSatılmış, Hami, Sedat Akleylek und Cheng-Chi Lee. „Efficient Implementations of Sieving and Enumeration Algorithms for Lattice-Based Cryptography“. Mathematics 9, Nr. 14 (08.07.2021): 1618. http://dx.doi.org/10.3390/math9141618.
Der volle Inhalt der QuelleBudroni, Alessandro, Qian Guo, Thomas Johansson, Erik Mårtensson und 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.
Der volle Inhalt der QuelleSengupta, Binanda, und Abhijit Das. „Use of SIMD-based data parallelism to speed up sieving in integer-factoring algorithms“. Applied Mathematics and Computation 293 (Januar 2017): 204–17. http://dx.doi.org/10.1016/j.amc.2016.08.019.
Der volle Inhalt der QuellePurinton, Benjamin, und 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.
Der volle Inhalt der QuelleWang, Shouhua, Shuaihu Wang und 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.
Der volle Inhalt der QuelleNowak, Damian, Rafał Adam Bachorz und 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.
Der volle Inhalt der QuelleDissertationen zum Thema "Sieving algorithms"
Kharchenko, Natalia. „Lattice algorithms and lattice-based cryptography“. Electronic Thesis or Diss., Sorbonne université, 2020. http://www.theses.fr/2020SORUS337.
Der volle Inhalt der QuelleLattice-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.
Der volle Inhalt der QuelleBücher zum Thema "Sieving algorithms"
Kockelman, Paul. Algorithms, Agents, and Ontologies. Oxford University Press, 2017. http://dx.doi.org/10.1093/acprof:oso/9780190636531.003.0007.
Der volle Inhalt der QuelleBuchteile zum Thema "Sieving algorithms"
Eiben, Eduard, Tomohiro Koana und Magnus Wahlström. „Determinantal Sieving“. In 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.
Der volle Inhalt der QuelleAndrzejczak, Michal, und Kris Gaj. „A Multiplatform Parallel Approach for Lattice Sieving Algorithms“. In 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.
Der volle Inhalt der QuelleSengupta, Binanda, und Abhijit Das. „SIMD-Based Implementations of Sieving in Integer-Factoring Algorithms“. In 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.
Der volle Inhalt der QuelleMcCoy, Hunter, Steven Hofmey, Katherine Yelick und Prashant Pandey. „Singleton Sieving: Overcoming the Memory/Speed Trade-Off in Exascale κ-mer Analysis“. In 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.
Der volle Inhalt der QuelleKirshanova, Elena, Erik Mårtensson, Eamonn W. Postlethwaite und Subhayan Roy Moulik. „Quantum Algorithms for the Approximate k-List Problem and Their Application to Lattice Sieving“. In Lecture Notes in Computer Science, 521–51. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-34578-5_19.
Der volle Inhalt der QuelleBuchmann, Johannes, Michael J. Jacobson, Stefan Neis, Patrick Theobald und Damian Weber. „Sieving Methods for Class Group Computation“. In 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.
Der volle Inhalt der QuelleDucas, Léo. „Estimating the Hidden Overheads in the BDGL Lattice Sieving Algorithm“. In Post-Quantum Cryptography, 480–97. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-17234-2_22.
Der volle Inhalt der QuelleDeng, Xixuan, und Huiwen Jia. „A New Self-dual BKZ Algorithm Based on Lattice Sieving“. In 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.
Der volle Inhalt der QuelleWang, Ping, und Dongdong Shang. „A New Lattice Sieving Algorithm Base on Angular Locality-Sensitive Hashing“. In Information Security and Cryptology, 65–80. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-75160-3_6.
Der volle Inhalt der QuelleDadush, Daniel. „A O(1/ε 2) n -Time Sieving Algorithm for Approximate Integer Programming“. In LATIN 2012: Theoretical Informatics, 207–18. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-29344-3_18.
Der volle Inhalt der QuelleKonferenzberichte zum Thema "Sieving algorithms"
Laarhoven, Thijs. „Evolutionary Techniques in Lattice Sieving Algorithms“. In 11th International Conference on Evolutionary Computation Theory and Applications. SCITEPRESS - Science and Technology Publications, 2019. http://dx.doi.org/10.5220/0007968800310039.
Der volle Inhalt der QuelleSatilmis, Hami, und Sedat Akleylek. „Efficient Implementations of Gauss-Based Sieving Algorithms“. In 2020 28th Signal Processing and Communications Applications Conference (SIU). IEEE, 2020. http://dx.doi.org/10.1109/siu49456.2020.9302189.
Der volle Inhalt der QuelleBecker, Anja, Léo Ducas, Nicolas Gama und Thijs Laarhoven. „New directions in nearest neighbor searching with applications to lattice sieving“. In 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.
Der volle Inhalt der QuelleAkleylek, Sedat, und Hami Satilmis. „Parameter Estimation for Lattice-Based Cryptosystems By Using Sieving Algorithms“. In 2019 4th International Conference on Computer Science and Engineering (UBMK). IEEE, 2019. http://dx.doi.org/10.1109/ubmk.2019.8907018.
Der volle Inhalt der QuelleSickory Daisy, S. Jancy, und A. Rijuvana Begum. „Email Spam Behavioral Sieving Technique using Hybrid Algorithm“. In 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.
Der volle Inhalt der QuelleDu, Wenna, Hongqiang Lin und Zehua Chen. „A Parallel Granular Sieving Algorithm for Global Optimization“. In 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.
Der volle Inhalt der QuelleMariano, Artur, Christian Bischof und Thijs Laarhoven. „Parallel (Probable) Lock-Free Hash Sieve: A Practical Sieving Algorithm for the SVP“. In 2015 44th International Conference on Parallel Processing (ICPP). IEEE, 2015. http://dx.doi.org/10.1109/icpp.2015.68.
Der volle Inhalt der QuelleJerdhaf, Oskar, Marina Santini, Peter Lundberg, Anette Karlsson und Arne Jönsson. „Implant Term Extraction from Swedish Medical Records – Phase 1: Lessons Learned“. In Eighth Swedish Language Technology Conference (SLTC-2020), 25-27 November 2020. Linköping University Electronic Press, 2021. http://dx.doi.org/10.3384/ecp184173.
Der volle Inhalt der Quelle