Generators of finite cyclic groups play important role in many cryptographic algorithms like public key ciphers, digital signatures, entity identification and key agreement algorithms. The above kinds of cryptographic algorithms are crucial for all secure communication in computer networks and secure information processing (in particular in mobile services, banking and electronic administration). In the paper, proofs of correctness of two probabilistic algorithms (for finding generators of finite cyclic groups and primitive roots) are given along with assessment of their average time computational complexity.
The formal models of physical systems are typically written in terms of differential equations. A transformation of the variables in a differential equation forms a symmetry group if it leaves the differential equation invariant. Symmetries of differential equations are very important for understanding of their properties. It can be said that the theory of Lie group symmetries of differential equations is general systematic method for finding solutions of differential equations. Despite of this fact, the Lie group theory is relatively unknown in engineering community. The paper is devoted to some important questions concerning this theory and for several equations resulting from the theory of elasticity their Lie group infinitesimal generators are given.
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.