1,720,959 research outputs found
Symetric encryption algorithms based on the mathematical structure underlying the three body problem
Full text linkThe three body problem is the founding problem of deterministic chaos theory. In this article
is proposed a new stream cipher algorithm based on a mathematical structure similar to that
underlying the 3 body poblem. Is also proposed to use said structure for the design of new bloc
ciphers and hash functions algorithms
Solving subset sum in polynomial time and proving P = NP
No full textIn this paper, we show that subset sum problem is solvable in polynomial tim
On a new fast public key cryptosystem
No full textThis paper presents a new fast public key cryptosystem namely: a key exchange algorithm, a public key encryption algorithm and a digital signature algorithm, based on the difficulty to invert the following function: F (x) = (a × x)Mod(2p)Div(2q). Mod is modulo operation, Div is integer division operation, a, p and q are known natural numbers while (p> q). In this paper it is also proven that this problem is equivalent to SAT problem which is NP complete
Subset sum, a new insight
Full text linkIn this paper, we show that subset sum problem consists on finding a solution over of equation where A and n are given matrix and integer and U = . We show that it can be subdivized into 2 solvable subproblems
Multidimentional ModDiv public key exchange protocol
Full text linkThis paper presents Multidimentional ModDiv public key exchange protocol which security is based on the hardness of an LWR problem instance consisting on finding a secret vector in knowing vectors and respectively in and , where elements of vector are defined as follows : = () .
Mod is integer modulo, Div is integer division, P and Q are known positive integers which sizes in bits are respectively p and q which satisfy . m and n satisfy
On a new fast public key cryptosystem
Full text linkThis paper presents a new fast public key cryptosystem namely : a key exchange algorithm,
a public key encryption algorithm and a digital signature algorithm, based on the difficulty to
invert the following function : F(x) = (a * x)Mod(2 power p)Div(2 power q) .
Mod is modulo operation , Div is integer division operation , a , p and q are integers where
(p > q) .
In this paper we also evaluate the hardness of this problem by reducing it to SAT
Going Beyond Counting First Authors in Author Co-citation Analysis
Full text linkThe present study examines one of the fundamental aspects of author co-citation analysis (ACA) - the way co-citation
counts are defined. Co-citation counting provides the data on which all subsequent statistical analyses and mappings
are based, and we compare ACA results based on two different types of co-citation counting - the traditional type that
only counts the first one among a cited work's authors on the one hand and a non-traditional type that takes into
account the first 5 authors of a cited work on the other hand. Results indicate that the picture produced through this non-traditional author co-citation counting contains more coherent author groups and is therefore considerably clearer. However, this picture represents fewer specialties in the research field being studied than that produced through the traditional first-author co-citation counting when the same number of top-ranked authors is selected and analyzed. Reasons for these effects are discussed
On a new properties of number sequences ,a randomness test and a new RC4\u27s key scheduling algorithm.
No full textIn this paper, we introduce the concept of the derivative of sequence of numbers and define new statistical indices by which we discoverd new properties of randomly generated number sequences.
We also build a test for pseudo random generators based on these properties and use it to confirm the weakness of RC4 key scheduling algorithm that has been reported in the litterature.
In this rescpect we publish a new RC4\u27s key scheduling algorithm that don\u27t have this weakness
Variations on the Author
Full text link“Variations on the Author” discusses two of Eduardo Coutinho’s recent films (Um Dia na Vida, from 2010, and Últimas Conversas, posthumously released in 2015) and their contribution to the general question of documentary authorship. The director’s filmography is characterized by a consistent yet self-effacing form of authorial self-inscription: Coutinho often features as an interviewer that rather than express opinions propels discourses; an interviewer that is good at listening. This mode of self-inscription characterizes him as an author who is not expressive but who is nonetheless markedly present on the screen. In Um Dia na Vida, however, Coutinho is completely absent form the image, while Últimas Conversas, on the contrary, includes a confessional prologue that moves the director from the margins to the center of his films. This article examines the ways in which these works stand out in the filmography of a director who offers new insights into the notion of cinematic authorship
- …
