Literatura científica selecionada sobre o tema "Randomization of arithmetic"
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 "Randomization of arithmetic".
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 "Randomization of arithmetic"
Emiris, Ioannis Z. "A Complete Implementation for Computing General Dimensional Convex Hulls". International Journal of Computational Geometry & Applications 08, n.º 02 (abril de 1998): 223–53. http://dx.doi.org/10.1142/s0218195998000126.
Texto completo da fontePoirier, Julia, GY Zou e John Koval. "Confidence intervals for a difference between lognormal means in cluster randomization trials". Statistical Methods in Medical Research 26, n.º 2 (29 de setembro de 2014): 598–614. http://dx.doi.org/10.1177/0962280214552291.
Texto completo da fonteGao, Pengfei, Hongyi Xie, Fu Song e Taolue Chen. "A Hybrid Approach to Formal Verification of Higher-Order Masked Arithmetic Programs". ACM Transactions on Software Engineering and Methodology 30, n.º 3 (maio de 2021): 1–42. http://dx.doi.org/10.1145/3428015.
Texto completo da fonteHegland, Markus. "Numerical methods for computing the greatest common divisor of univariate polynomials using floating point arithmetic". ANZIAM Journal 60 (15 de agosto de 2019): C127—C139. http://dx.doi.org/10.21914/anziamj.v60i0.14059.
Texto completo da fontePearce, S. C. "Some Design Problems in Crop Experimentation. I. The Use of Blocks". Experimental Agriculture 31, n.º 2 (abril de 1995): 191–204. http://dx.doi.org/10.1017/s0014479700025278.
Texto completo da fonteSchicho, Kurt, Michael Figl, Rudolf Seemann, Markus Donat, Michael L. Pretterklieber, Wolfgang Birkfellner, Astrid Reichwein et al. "Comparison of laser surface scanning and fiducial marker–based registration in frameless stereotaxy". Journal of Neurosurgery 106, n.º 4 (abril de 2007): 704–9. http://dx.doi.org/10.3171/jns.2007.106.4.704.
Texto completo da fonteAllen, Brian, Edward Florez, Reza Sirous, Seth T. Lirette, Michael Griswold, Erick M. Remer, Zhen J. Wang et al. "Comparative effectiveness of tumor response assessment methods: Standard-of-care versus computer-assisted response evaluation." Journal of Clinical Oncology 35, n.º 6_suppl (20 de fevereiro de 2017): 432. http://dx.doi.org/10.1200/jco.2017.35.6_suppl.432.
Texto completo da fonteAllen, Brian C., Edward Florez, Reza Sirous, Seth T. Lirette, Michael Griswold, Erick M. Remer, Zhen J. Wang et al. "Comparative Effectiveness of Tumor Response Assessment Methods: Standard of Care Versus Computer-Assisted Response Evaluation". JCO Clinical Cancer Informatics, n.º 1 (novembro de 2017): 1–16. http://dx.doi.org/10.1200/cci.17.00026.
Texto completo da fonteKrymovskyi, K. G., O. A. Kaniura e T. M. Kostiuk. "Necessary diagnostic criteria of dental crowding in children during mixed dentition with different facial skeleton growth patterns". Reports of Vinnytsia National Medical University 25, n.º 4 (30 de novembro de 2021): 616–19. http://dx.doi.org/10.31393/reports-vnmedical-2021-25(4)-18.
Texto completo da fonteNakai, Takeshi, Yuto Misawa, Yuuki Tokushige, Mitsugu Iwamoto e Kazuo Ohta. "How to Solve Millionaires’ Problem with Two Kinds of Cards". New Generation Computing, 5 de janeiro de 2021. http://dx.doi.org/10.1007/s00354-020-00118-8.
Texto completo da fonteTeses / dissertações sobre o assunto "Randomization of arithmetic"
Courtois, Jérôme. "Leak study of cryptosystem implementations in randomized RNS arithmetic". Electronic Thesis or Diss., Sorbonne université, 2020. http://www.theses.fr/2020SORUS290.
Texto completo da fonteWe will speak of strong analysis for an analysis which makes it possible to find the key to a cryptographic system. We define a weak analysis in the case where candidate keys are eliminated. The goal of this thesis is to understand the behavior of the random of Hamming distances produced by an ECC (Elliptic Curve for Cryptography) cryptographic system when using a RNS (Residue Number System) representation with the random moduli method. Chapter 2 introduces the different concepts for understanding this document. He brieflyintroducesthemodularmultiplicationalgorithm(MontgomeryalgorithmforRNS) which inspired the method of random moduli. Then it describes the algorithm which generatestheHammingdistancesequencesnecessaryforouranalysis. Thenitshowswhat level of resistance brings the method of random moduli against different classic attacks like DPA (Diferrential Power Analysis), CPA (Correlation Power Analysis), DPA of the second order and MIA (Mutual Information Analysis). We provide an understanding of the distribution of Hamming distances considered to be random variables. Following this, we add the Gaussian hypothesis on Hamming distances. We use MLE (Maximum Likelihood Estimator) and a strong analysis as to make Template Attacks to have a fine understanding of the level of random brought by the method of random moduli. The last Chapter 4 begins by briefly introducing the algorithmic choices which have been made to solve the problems of inversion of covariance matrices (symmetric definite positive) of Section 2.5 and the analysis of strong relationships between Hamming in Section 3.2. We use here Graphics Processing Unit (GPU) tools on a very large number of small size matrices. We talk about Batch Computing. The LDLt method presented at the beginning of this chapter proved to be insufficient to completely solve the problem of conditioned MLE presented in Section 3.4. We present work on the improvement of a diagonalization code of a tridiagonal matrix using the principle of Divide & Conquer developed by Lokmane Abbas-Turki and Stéphane Graillat. We present a generalization of this code, optimizations in computation time and an improvement of the accuracy of computations in simple precision for matrices of size lower than 32
Marrez, Jérémy. "Représentations adaptées à l'arithmétique modulaire et à la résolution de systèmes flous". Electronic Thesis or Diss., Sorbonne université, 2019. https://accesdistant.sorbonne-universite.fr/login?url=https://theses-intra.sorbonne-universite.fr/2019SORUS635.pdf.
Texto completo da fonteModular computations involved in public key cryptography applications most often use a standardized prime modulo, the choice of which is not always free in practice. The improvement of modular operations is fundamental for the efficiency and safety of these primitives. This thesis proposes to provide an efficient modular arithmetic for the largest possible number of primes, while protecting it against certain types of attacks. For this purpose, we are interested in the PMNS system used for modular arithmetic, and propose methods to obtain many PMNS for a given prime, with an efficient arithmetic on the representations. We also consider the randomization of modular computations via algorithms of type Montgomery and Babaï by exploiting the intrinsic redundancy of PMNS. Induced changes of data representation during the calculation prevent an attacker from making useful assumptions about these representations. We then present a hybrid system, HyPoRes , with an algorithm that improves modular reductions for any prime modulo. The numbers are represented in a PMNS with coefficients in RNS. The modular reduction is faster than in conventional RNS for the primes standardized for ECC. In parallel, we are interested in a type of representation used to compute real solutions of fuzzy systems. We revisit the global approach of resolution using classical algebraic techniques and strengthen it. These results include a real system called the real transform that simplifies computations, and the management of the signs of the solutions
Dosso, Fangan Yssouf. "Contribution de l'arithmétique des ordinateurs aux implémentations résistantes aux attaques par canaux auxiliaires". Electronic Thesis or Diss., Toulon, 2020. http://www.theses.fr/2020TOUL0007.
Texto completo da fonteThis thesis focuses on two currently unavoidable elements of public key cryptography, namely modular arithmetic over large integers and elliptic curve scalar multiplication (ECSM). For the first one, we are interested in the Adapted Modular Number System (AMNS), which was introduced by Bajard et al. in 2004. In this system of representation, the elements are polynomials. We show that this system allows to perform modular arithmetic efficiently. We also explain how AMNS can be used to randomize modular arithmetic, in order to protect cryptographic protocols implementations against some side channel attacks. For the ECSM, we discuss the use of Euclidean Addition Chains (EAC) in order to take advantage of the efficient point addition formula proposed by Meloni in 2007. The goal is to first generalize to any base point the use of EAC for ECSM; this is achieved through curves with one efficient endomorphism. Secondly, we propose an algorithm for scalar multiplication using EAC, which allows error detection that would be done by an attacker we detail
Samuel, Sindhu. "Digital rights management (DRM) - watermark encoding scheme for JPEG images". Diss., 2008. http://hdl.handle.net/2263/27910.
Texto completo da fonteDissertation (MEng)--University of Pretoria, 2008.
Electrical, Electronic and Computer Engineering
unrestricted
Trabalhos de conferências sobre o assunto "Randomization of arithmetic"
Didier, Laurent-Stephane, Fangan-Yssouf Dosso, Nadia El Mrabet, Jeremy Marrez e Pascal Veron. "Randomization of Arithmetic Over Polynomial Modular Number System". In 2019 IEEE 26th Symposium on Computer Arithmetic (ARITH). IEEE, 2019. http://dx.doi.org/10.1109/arith.2019.00048.
Texto completo da fonte