ON THE LEPTONIC DECAY CONSTANTS OF THE PSEUDOSCALAR D-MESON AND B-MESON

1983-01-01
SOVIET JOURNAL OF NUCLEAR PHYSICS-USSR

Suggestions

On the expected value of the linear complexity of periodic sequences
Özakın, Çiğdem; Özbudak, Ferruh; Department of Cryptography (2004)
In cryptography, periodic sequences with terms in F2 are used almost everywhere. These sequences should have large linear complexity to be cryptographically strong. In fact, the linear complexity of a sequence should be close to its period. In this thesis, we study the expected value for N-periodic sequences with terms in the finite field Fq. This study is entirely devoted to W. Meidl and Harald Niederreiter̕s paper which is أOn the Expected Value of the Linear Complexity and the k-Error Linear Complexity o...
On the errors arising in surface integral equations due to the discretization of the identity operatort
Ergül, Özgür Salih (2009-06-05)
Surface integral equations (SIEs) are commonly used to formulate scattering and radiation problems involving three-dimensional metallic and homogeneous dielectric objects with arbitrary shapes. For numerical solutions, equivalent electric and/or magnetic currents defined on surfaces are discretized and expanded in a series of basis functions. Then, the boundary conditions are tested on surfaces via a set of testing functions. Solutions of the resulting dense matrix equations provide the expansion coefficien...
ON THE PERIOD LENGTH OF CONGRUENTIAL PSEUDORANDOM NUMBER SEQUENCES GENERATED BY INVERSIONS
EICHENAUERHERRMANN, J; TOPUZOGLU, A (1990-07-24)
Congruential pseudorandom number sequences generated by inversions have been studied recently. These sequences do not show the undesirable lattice structure of the linear congruential method. The necessary and sufficient condition for the generated sequence to have the maximal period length was given by Eichenauer (1988) for the case of 2e modulus. Generalization of this result to the case of an arbitrary prime power modulus is obtained.
On the Polynomial Multiplication in Chebyshev Form
Akleylek, Sedat; Cenk, Murat; Özbudak, Ferruh (2012-04-01)
We give an efficient multiplication method for polynomials in Chebyshev form. This multiplication method is different from the previous ones. Theoretically, we show that the number of multiplications is at least as good as Karatsuba-based algorithm. Moreover, using the proposed method, we improve the number of additions slightly. We remark that our method works efficiently for any N and it is easy to implement. To the best of our knowledge, the proposed method has the best multiplication and addition comple...
On the Number of Arithmetic Operations in NTT-based Polynomial Multiplication in Kyber and Dilithium Cryptosystems
Ilter, Murat Burhan; Kocak, Nese; Uslu, Erkan; Yayla, Oğuz; Yuca, Nergiz (2021-01-01)
National Institute of Standards and Technology (NIST) initiated a post-quantum standardization process in 2016, and as of July 2020, Round 3 candidates were announced. Among these candidates, Crystals-Kyber and Crystals-Dilithium are the most promising lattice-based key encapsulation mechanism (KEM) and signature algorithm that rely on the module learning with errors (Module-LWE) problem. In general, polynomial multiplication is one of the most time-consuming operations in Module-LWE based cryptosystems. Th...
Citation Formats
T. Alıyev, “ON THE LEPTONIC DECAY CONSTANTS OF THE PSEUDOSCALAR D-MESON AND B-MESON,” SOVIET JOURNAL OF NUCLEAR PHYSICS-USSR, pp. 936–938, 1983, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/55614.