Zobrazeno 1 - 10
of 115
pro vyhledávání: '"Euclid's algorithm"'
Autor:
Daniel J. Bernstein, Bo-Yin Yang
Publikováno v:
Transactions on Cryptographic Hardware and Embedded Systems, Vol 2019, Iss 3 (2019)
This paper introduces streamlined constant-time variants of Euclid’s algorithm, both for polynomial inputs and for integer inputs. As concrete applications, this paper saves time in (1) modular inversion for Curve25519, which was previously believe
Externí odkaz:
https://doaj.org/article/8252bb3e0d9d47d080a37c70897ccfb9
Autor:
Sukop, Juraj, Möller, Niels
An improved bound for one of the founding relations of HGCD-D algorithm is presented. This allows to put a lower limit on the iteration count of the first sdiv loop, to impose a particular structure on the accumulated quotients and to bound the size
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______166::d6b5d190ce50175590cdbf54088abd15
https://hal.science/hal-03976898
https://hal.science/hal-03976898
Autor:
Alzalg, Baha
In this book chapter, we present and analyze some standard array and numeric algorithms, such as array multiplication algorithms, array searching algorithms, array sorting algorithms, and Newton’s method algorithm for solving linear and nonlinearsy
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b21df7d4e0a1fda911b9ebe1b5b50e61
Autor:
Novotny, Martina
Skup Gaussovih cijelih brojeva označavamo sa \(\mathbb{Z}[i]=\{a+bi:a,b\in\}\) i on čini komutativni prsten s jedinicom s obzirom na zbrajanje i množenje kompleksnih brojeva. U radu se obrađuju standardne teme kao što su djeljivost, Gaussovi pro
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______3908::7be508f63b78d302af8fef09b0c6cfca
https://repozitorij.pmf.unizg.hr/islandora/object/pmf:10744/datastream/PDF
https://repozitorij.pmf.unizg.hr/islandora/object/pmf:10744/datastream/PDF
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Brückler, Franka Miriam
Publikováno v:
Osječki matematički list
Volume 22
Issue 1
Volume 22
Issue 1
Jedno od najpoznatijih djela u povijesti matematike je starokineski tekst Devet poglavlja. U ovom članku opisujemo njegov sadržaj i značaj, ali ga i komentiramo iz moderne perspektive
One of the most famous texts in the history of mathematics
One of the most famous texts in the history of mathematics
Autor:
Josep M. Brunat, Joan-C. Lario
Publikováno v:
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
Universitat Politècnica de Catalunya (UPC)
Motivated by the design of satins with draft of period m and step a, we draw our attention to the lattices $$L(m,a)=\langle (1,a),(0,m)\rangle$$ L ( m , a ) = ⟨ ( 1 , a ) , ( 0 , m ) ⟩ where $$1\le a 1 ≤ a < m are integers with $$\gcd (m,a)=1$$
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::aae3491c8aa60544e538039092a923dc
https://hdl.handle.net/2117/365868
https://hdl.handle.net/2117/365868
Autor:
Maria Michalska, Justyna Walewska
Publikováno v:
Bulletin of the Brazilian Mathematical Society, New Series. 50:95-117
The aim of this paper is to show the possible Milnor numbers of deformations of semi-quasi-homogeneous isolated plane curve singularity f. Assuming that f is irreducible, one can write $$ f = \sum _{q\alpha + p\beta \ \ge \ pq}c_{\alpha \beta }\ x^{\
Autor:
Brigitte Vallée, Antonio Vera
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings vol. AH,..., Iss Proceedings (2007)
The Gaussian algorithm for lattice reduction in dimension 2 is precisely analysed under a class of realistic probabilistic models, which are of interest when applying the Gauss algorithm "inside'' the LLL algorithm. The proofs deal with the underlyin
Externí odkaz:
https://doaj.org/article/aafe3e632c0c40b7b2bc59377815a216