|
|
|
|
|
Pau Fonseca i Casas, Iza Romanowska and Joan Garcia i Subirana
Specification and Description Language (SDL) is a language that can represent the behavior and structure of a model completely and unambiguously. It allows the creation of frameworks that can run a model without the need to code it in a specific programm...
ver más
|
|
|
|
|
|
|
|
|
|
|
Barry Fagin
Previous work established the set of square-free integers n with at least one factorization ??=??¯??¯
n
=
p
¯
q
¯
for which ??¯
p
¯
and ??¯
q
¯
are valid RSA keys, whether they are prime or composite. These integers are exactly those with the property...
ver más
|
|
|
|
|
|
|
|
|
|
|
Gennady Ryabov,Vladimir Serov
Pág. 28 - 32
The article is a continuation of the natural numbers structure research from the position of representation in the form of six infinite arithmetic progressions and addition and multiplication semi-group actions on this set. Such representation leads to t...
ver más
|
|
|
|
|
|
|
|
|
|
|
G.G. Ryabov,V.A. Serov
Pág. 27 - 31
The article concerns the structure of natural numbers as a discrete dynamical system based on the billiard graph and the research of the introduced singularity concept and the set of singular circles. It allows to consider the structure of natural number...
ver más
|
|
|
|
|
|
|
|
|
|
|
Mohammad Andri Budiman, Dian Rachmawati
Pág. 45 - 52
Abstract. The security of the RSA cryptosystem is directly proportional to the size of its modulus, n. The modulus n is a multiplication of two very large prime numbers, notated as p and q. Since modulus n is public, a cryptanalyst can use factorization ...
ver más
|
|
|
|
|
|
|
|
|
|
|
Tom-Robin Teschner, László Könözsy and Karl W. Jenkins
The present work investigates the bifurcation properties of the Navier?Stokes equations using characteristics-based schemes and Riemann solvers to test their suitability to predict non-linear flow phenomena encountered in aerospace applications. We make ...
ver más
|
|
|
|
|
|
|
|
|
|
|
Ade Candra, Mohammad Andri Budiman, Dian Rachmawati
Pág. 30 - 37
It is intuitively clear that the security of RSA cryptosystem depends on the hardness of factoring a very large integer into its two prime factors. Numerous studies about integer factorization in the field of number theory have been carried out, and as a...
ver más
|
|
|
|
|
|
|
|
|
|
|
Omar Iván Trejos Buriticá
Pág. 116 - 126
Resumen Autores/asDescargasReferenciasCómo citar
|
|
|
|
|
|
|
|
|
|
|
Wayne S. Kendal and Bent Jørgensen
-
|
|
|
|
|
|
|
|
|
|
|
Peter L. Montgomery; Sangil Nahm; Samuel S. Wagstaff Jr.
Pág. 1793 - 1800
|
|
|
|
|
|