Academic literature on the topic 'Algorithmes de sieving'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Algorithmes de sieving.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Algorithmes de sieving"

1

Bai, Shi, Thijs Laarhoven, and Damien Stehlé. "Tuple lattice sieving." LMS Journal of Computation and Mathematics 19, A (2016): 146–62. http://dx.doi.org/10.1112/s1461157016000292.

Full text
Abstract:
Lattice sieving is asymptotically the fastest approach for solving the shortest vector problem (SVP) on Euclidean lattices. All known sieving algorithms for solving the SVP require space which (heuristically) grows as $2^{0.2075n+o(n)}$, where $n$ is the lattice dimension. In high dimensions, the memory requirement becomes a limiting factor for running these algorithms, making them uncompetitive with enumeration algorithms, despite their superior asymptotic time complexity.We generalize sieving algorithms to solve SVP with less memory. We consider reductions of tuples of vectors rather than pa
APA, Harvard, Vancouver, ISO, and other styles
2

Mukhopadhyay, Priyanka. "Faster Provable Sieving Algorithms for the Shortest Vector Problem and the Closest Vector Problem on Lattices in ℓp Norm". Algorithms 14, № 12 (2021): 362. http://dx.doi.org/10.3390/a14120362.

Full text
Abstract:
In this work, we give provable sieving algorithms for the Shortest Vector Problem (SVP) and the Closest Vector Problem (CVP) on lattices in ℓp norm (1≤p≤∞). The running time we obtain is better than existing provable sieving algorithms. We give a new linear sieving procedure that works for all ℓp norm (1≤p≤∞). The main idea is to divide the space into hypercubes such that each vector can be mapped efficiently to a sub-region. We achieve a time complexity of 22.751n+o(n), which is much less than the 23.849n+o(n) complexity of the previous best algorithm. We also introduce a mixed sieving proced
APA, Harvard, Vancouver, ISO, and other styles
3

Grémy, Laurent. "Higher-dimensional sieving for the number field sieve algorithms." Open Book Series 2, no. 1 (2019): 275–91. http://dx.doi.org/10.2140/obs.2019.2.275.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Satılmış, Hami, Sedat Akleylek, and Cheng-Chi Lee. "Efficient Implementations of Sieving and Enumeration Algorithms for Lattice-Based Cryptography." Mathematics 9, no. 14 (2021): 1618. http://dx.doi.org/10.3390/math9141618.

Full text
Abstract:
The security of lattice-based cryptosystems is based on solving hard lattice problems such as the shortest vector problem (SVP) and the closest vector problem (CVP). Various cryptanalysis algorithms such as (Pro)GaussSieve, HashSieve, ENUM, and BKZ have been proposed to solve these hard problems. Several implementations of these algorithms have been developed. On the other hand, the implementations of these algorithms are expected to be efficient in terms of run time and memory space. In this paper, a modular software package/library containing efficient implementations of GaussSieve, ProGauss
APA, Harvard, Vancouver, ISO, and other styles
5

Shi, Wenhao, Haodong Jiang, and Zhi Ma. "Solving HNP with One Bit Leakage: An Asymmetric Lattice Sieving Algorithm." Entropy 25, no. 1 (2022): 49. http://dx.doi.org/10.3390/e25010049.

Full text
Abstract:
The Hidden Number Problem (HNP) was introduced by Boneh and Venkastesan to analyze the bit-security of the Diffie–Hellman key exchange scheme. It is often used to mount a side-channel attack on (EC)DSA. The hardness of HNP is mainly determined by the number of nonce leakage bits and the size of the modulus. With the development of lattice reduction algorithms and lattice sieving, the range of practically vulnerable parameters are extended further. However, 1-bit leakage is still believed to be challenging for lattice attacks. In this paper, we proposed an asymmetric lattice sieving algorithm t
APA, Harvard, Vancouver, ISO, and other styles
6

Sengupta, Binanda, and Abhijit Das. "Use of SIMD-based data parallelism to speed up sieving in integer-factoring algorithms." Applied Mathematics and Computation 293 (January 2017): 204–17. http://dx.doi.org/10.1016/j.amc.2016.08.019.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Budroni, Alessandro, Qian Guo, Thomas Johansson, Erik Mårtensson, and Paul Stankovski Wagner. "Improvements on Making BKW Practical for Solving LWE." Cryptography 5, no. 4 (2021): 31. http://dx.doi.org/10.3390/cryptography5040031.

Full text
Abstract:
The learning with errors (LWE) problem is one of the main mathematical foundations of post-quantum cryptography. One of the main groups of algorithms for solving LWE is the Blum–Kalai–Wasserman (BKW) algorithm. This paper presents new improvements of BKW-style algorithms for solving LWE instances. We target minimum concrete complexity, and we introduce a new reduction step where we partially reduce the last position in an iteration and finish the reduction in the next iteration, allowing non-integer step sizes. We also introduce a new procedure in the secret recovery by mapping the problem to
APA, Harvard, Vancouver, ISO, and other styles
8

Purinton, Benjamin, and Bodo Bookhagen. "Introducing <i>PebbleCounts</i>: a grain-sizing tool for photo surveys of dynamic gravel-bed rivers." Earth Surface Dynamics 7, no. 3 (2019): 859–77. http://dx.doi.org/10.5194/esurf-7-859-2019.

Full text
Abstract:
Abstract. Grain-size distributions are a key geomorphic metric of gravel-bed rivers. Traditional measurement methods include manual counting or photo sieving, but these are achievable only at the 1–10 m2 scale. With the advent of drones and increasingly high-resolution cameras, we can now generate orthoimagery over hectares at millimeter to centimeter resolution. These scales, along with the complexity of high-mountain rivers, necessitate different approaches for photo sieving. As opposed to other image segmentation methods that use a watershed approach, our open-source algorithm, PebbleCounts
APA, Harvard, Vancouver, ISO, and other styles
9

Wang, Shouhua, Shuaihu Wang, and Xiyan Sun. "A Multi-Scale Anti-Multipath Algorithm for GNSS-RTK Monitoring Application." Sensors 23, no. 20 (2023): 8396. http://dx.doi.org/10.3390/s23208396.

Full text
Abstract:
During short baseline measurements in the Real-Time Kinematic Global Navigation Satellite System (GNSS-RTK), multipath error has a significant impact on the quality of observed data. Aiming at the characteristics of multipath error in GNSS-RTK measurements, a novel method that combines improved complete ensemble empirical mode decomposition with adaptive noise (ICEEMDAN) and adaptive wavelet packet threshold denoising (AWPTD) is proposed to reduce the effects of multipath error in GNSS-RTK measurements through modal function decomposition, effective coefficient sieving, and adaptive thresholdi
APA, Harvard, Vancouver, ISO, and other styles
10

Nowak, Damian, Rafał Adam Bachorz, and Marcin Hoffmann. "Neural Networks in the Design of Molecules with Affinity to Selected Protein Domains." International Journal of Molecular Sciences 24, no. 2 (2023): 1762. http://dx.doi.org/10.3390/ijms24021762.

Full text
Abstract:
Drug design with machine learning support can speed up new drug discoveries. While current databases of known compounds are smaller in magnitude (approximately 108), the number of small drug-like molecules is estimated to be between 1023 and 1060. The use of molecular docking algorithms can help in new drug development by sieving out the worst drug-receptor complexes. New chemical spaces can be efficiently searched with the application of artificial intelligence. From that, new structures can be proposed. The research proposed aims to create new chemical structures supported by a deep neural n
APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Algorithmes de sieving"

1

Kharchenko, Natalia. "Lattice algorithms and lattice-based cryptography." Electronic Thesis or Diss., Sorbonne université, 2020. http://www.theses.fr/2020SORUS337.

Full text
Abstract:
La cryptographie basée sur les réseaux est un domaine de recherche qui étudie la construction d'outils pour une communication sécurisée basée sur des problèmes de réseaux difficiles. La cryptographie basée sur les réseau est l'un des candidats les plus prometteurs pour la communication sécurisée post-quantique. Cette thèse étudie les algorithmes pour résoudre les problèmes de réseaux difficiles et leur application à l'évaluation de la sécurité des constructions cryptographiques. Dans la première partie, nous introduisons une nouvelle famille d'algorithmes de sieving appelé sieving cylindrique.
APA, Harvard, Vancouver, ISO, and other styles
2

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.

Full text
Abstract:
A new computer simulation algorithm is developed to study the behavior of a hard sphere during gel electrophoresis. The electrophoresis mobility and the diffusion coefficients are presented to show the effects of the field intensity, of the gel concentration, and of the randomness of the gel. The results indicate that previous models are not applicable for either the periodic or the random gel, and that the Einstein relation does not hold because the gel molecules affect the dynamics of the hard sphere. Moreover, the randomness of sieving gels lead to a trapping effect where the longitudinal d
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Algorithmes de sieving"

1

Kockelman, Paul. Algorithms, Agents, and Ontologies. Oxford University Press, 2017. http://dx.doi.org/10.1093/acprof:oso/9780190636531.003.0007.

Full text
Abstract:
This chapter details the inner workings of spam filters, algorithmic devices that separate desirable messages from undesirable messages. It argues that such filters are a particularly important kind of sieve insofar as they readily exhibit key features of sieving devices in general, and algorithmic sieving in particular. More broadly, it describes the relation between ontology (assumptions that drive interpretations) and inference (interpretations that alter assumptions) as it plays out in the classification and transformation of identities, types, or kinds. Focusing on the unstable processes
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Algorithmes de sieving"

1

Eiben, Eduard, Tomohiro Koana, and Magnus Wahlström. "Determinantal Sieving." In Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). Society for Industrial and Applied Mathematics, 2024. http://dx.doi.org/10.1137/1.9781611977912.16.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Buchmann, Johannes, Michael J. Jacobson, Stefan Neis, Patrick Theobald, and Damian Weber. "Sieving Methods for Class Group Computation." In Algorithmic Algebra and Number Theory. Springer Berlin Heidelberg, 1999. http://dx.doi.org/10.1007/978-3-642-59932-3_1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Andrzejczak, Michal, and Kris Gaj. "A Multiplatform Parallel Approach for Lattice Sieving Algorithms." In Algorithms and Architectures for Parallel Processing. Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-60245-1_45.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Sengupta, Binanda, and Abhijit Das. "SIMD-Based Implementations of Sieving in Integer-Factoring Algorithms." In Security, Privacy, and Applied Cryptography Engineering. Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-41224-0_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Ducas, Léo. "Estimating the Hidden Overheads in the BDGL Lattice Sieving Algorithm." In Post-Quantum Cryptography. Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-17234-2_22.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Deng, Xixuan, and Huiwen Jia. "A New Self-dual BKZ Algorithm Based on Lattice Sieving." In Communications in Computer and Information Science. Springer Nature Singapore, 2024. http://dx.doi.org/10.1007/978-981-99-9331-4_22.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Wang, Ping, and Dongdong Shang. "A New Lattice Sieving Algorithm Base on Angular Locality-Sensitive Hashing." In Information Security and Cryptology. Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-75160-3_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

McCoy, Hunter, Steven Hofmey, Katherine Yelick, and Prashant Pandey. "Singleton Sieving: Overcoming the Memory/Speed Trade-Off in Exascale κ-mer Analysis." In SIAM Conference on Applied and Computational Discrete Algorithms (ACDA23). Society for Industrial and Applied Mathematics, 2023. http://dx.doi.org/10.1137/1.9781611977714.19.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Dadush, Daniel. "A O(1/ε 2) n -Time Sieving Algorithm for Approximate Integer Programming." In LATIN 2012: Theoretical Informatics. Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-29344-3_18.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Kirshanova, Elena, Erik Mårtensson, Eamonn W. Postlethwaite, and Subhayan Roy Moulik. "Quantum Algorithms for the Approximate k-List Problem and Their Application to Lattice Sieving." In Lecture Notes in Computer Science. Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-34578-5_19.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Algorithmes de sieving"

1

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Satilmis, Hami, and 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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Becker, Anja, Léo Ducas, Nicolas Gama, and 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. Society for Industrial and Applied Mathematics, 2015. http://dx.doi.org/10.1137/1.9781611974331.ch2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Sickory Daisy, S. Jancy, and 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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Du, Wenna, Hongqiang Lin, and 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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Akleylek, Sedat, and 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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Mariano, Artur, Christian Bischof, and 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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Jerdhaf, Oskar, Marina Santini, Peter Lundberg, Anette Karlsson, and 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.

Full text
Abstract:
We present the case of automatic identification of “implant terms”. Implant terms are specialized terms that are important for domain experts (e.g. radiologists), but they are difficult to retrieve automatically because their presence is sparse. The need of an automatic identification of implant terms spurs from safety reasons because patients who have an implant may be at risk if they undergo Magnetic Resonance Imaging (MRI). At present, the workflow to verify whether a patient could be at risk of MRI side-effects is manual and laborious. We claim that this workflow can be sped up, streamline
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!