排序方式: 共有62条查询结果,搜索用时 31 毫秒
1.
2.
3.
4.
We present here some results on the applications of linear recursive sequences of order $2$ to the Fermat pseudoprimes, Fibonacci pseudoprimes, and Dickson pseudoprimes. 相似文献
5.
6.
Raúl Felipe-Sosa Raúl Felipe Juana Sánchez-Ortega Michael K. Kinyon 《Linear and Multilinear Algebra》2013,61(6):811-830
We adapt the algorithm of Kolesnikov and Pozhidaev, which converts a polynomial identity for algebras into the corresponding identities for dialgebras, to the Cayley–Dickson doubling process. We obtain a generalization of this process to the setting of dialgebras, establish some of its basic properties, and construct dialgebra analogues of the quaternions and octonions. 相似文献
7.
Linear complexity and linear complexity profile are important characteristics of a sequence for applications in cryptography
and Monte-Carlo methods.
The nonlinear congruential method is an attractive alternative to the classical linear congruential method for pseudorandom
number generation.
Recently, a weak lower bound on the linear complexity profile of a general nonlinear congruential pseudorandom number generator
was proven by Gutierrez, Shparlinski and the first author. For most nonlinear generators a much stronger lower bound is expected.
Here, we obtain a much stronger lower bound on the linear complexity profile of nonlinear congruential pseudorandom number
generators with Dickson polynomials. 相似文献
8.
An explicit construction of polynomials over a finite field of odd characteristic, for which the absolute value of trigonometric sums attains the Weil bound, is based on the construction of cyclic matrices of given rank. Dickson polynomials of the second kind play an essential role in the study of such matrices.__________Translated from Matematicheskie Zametki, vol. 78, no. 1, 2005, pp. 16–25.Original Russian Text Copyright © 2005 by L. A. Bassalygo, V. A. Zinov’ev. 相似文献
9.
The relativistic first-order wave equations for massive particles with spin 0,1,1/2 are formulated in terms of a factorization of the Klein–Fock equation by means of the algebra of octonions. An analogous method applied to Hamiltonian of the quantum isotropic oscillator leads to the natural generalization of the model. The class of supersymmetric oscillators with dimension N7 associated with te algebras of the Cayley–Dickson series is introduced. 相似文献
10.
Let q=pr with p=3 and r2. We give a recursion formula for the moments of a Kloosterman sum over the finite field , which utilizes known weight formulae for the ternary Melas code M of length q−1. The method is illustrated by giving explicit formulae for the moments up to the tenth moment. As an application for the formulae, and for their analogues obtained earlier in case p=2, we get the exact number of rational points on fibre products of certain Kloosterman curves. As a corollary we obtain identities between Ramanujan's tau-function, Kronecker class numbers, and Dickson polynomials. 相似文献