Serwis Infona wykorzystuje pliki cookies (ciasteczka). Są to wartości tekstowe, zapamiętywane przez przeglądarkę na urządzeniu użytkownika. Nasz serwis ma dostęp do tych wartości oraz wykorzystuje je do zapamiętania danych dotyczących użytkownika, takich jak np. ustawienia (typu widok ekranu, wybór języka interfejsu), zapamiętanie zalogowania. Korzystanie z serwisu Infona oznacza zgodę na zapis informacji i ich wykorzystanie dla celów korzytania z serwisu. Więcej informacji można znaleźć w Polityce prywatności oraz Regulaminie serwisu. Zamknięcie tego okienka potwierdza zapoznanie się z informacją o plikach cookies, akceptację polityki prywatności i regulaminu oraz sposobu wykorzystywania plików cookies w serwisie. Możesz zmienić ustawienia obsługi cookies w swojej przeglądarce.
We present an $r$<alternatives> <inline-graphic xlink:type="simple" xlink:href="kwon-ieq6-2417562.gif"/></alternatives>-th root extraction algorithm over a finite field $\mathbb {F}_q$<alternatives> <inline-graphic xlink:type="simple" xlink:href="kwon-ieq7-2417562.gif"/></alternatives>. Our algorithm precomputes a primitive...
The main goal of data mining is to extract useful information from large amounts of database. However, data is often collected by several different sites. Among these, association rule mining has wide applications to find interesting relationships among attributes. In this paper we use concept of distributed database, when divided the centralize database into distributed database environment, database...
The expanding possibilities of the modern communication demand certain means of security that promote confidentiality as well as the integrity of information. To bypass the attention of the potential attackers, the domain of steganography as a whole minimizes the chances of tracing out or detecting any kind of hidden information during transmission. In this paper, we propose a new steganographic technique...
The massive amount of data transfer over internet raises different challenges such as channel types, transmission time and data security. In this paper, we present a novel secure algorithm to hide the data inside document files, where four symbols are used to embed the data inside the carrier file. The main process depends on a key to produce a symbol table and match the data to be hidden with the...
A (worst-case) 2-source extractor is a deterministic algorithm that transforms pairwise independent weak random sources into almost uniform random strings. Despite non-constructive proofs that such objects exist with almost optimal parameters, it has been a longstanding open problem to construct ‘explicit’ (aka efficient) functions for sources of ‘small’ constant entropy rate. In particular, best...
The present paper proposes a new method for hiding any encrypted secret message inside a text/ASCII or Microsoft word document file, by manipulating the blank/white space characters of a cover file. Initially the secret message is encrypted using Modified Generalized Vernam Cipher Method (MGVCM) proposed by Nath et. al. For hiding secret message inside any ASCII file we propose a new method in which...
In the original paper of RSA, it is proved that there exists a probabilistic polynomial-time equivalence between computing d and factoring N. And later, May presented a deterministic polynomial time algorithm that factors N given (e,d) provided that e,d < ??(N). Let p and q are balanced primes and N = pq, where gcd(p - 1, q - 1) = 2g with g being a prime, and (N - 1)/(2g) also being a prime. A...
We put forward the concepts of universal authentication, restrictive authentication and designated authentication. We then revisit a popular signcryption scheme using a technique similar to the one developed in Schnorr's signature, allowing it respects the restrictive authentication property. Comparing with the modification suggested by Baek et al in 2007, which uses a zero-knowledge proof run between...
Recently, Yu et al. proposed two identity based signcryption schemes, one is an identity based signcryption scheme for multiple receivers and the other is an identity based signcryption scheme without random oracles. They showed their former scheme is secure against adaptive chosen ciphertext attacks and unforgeable in the random oracle model, and the latter scheme is secure against adaptive chosen...
Privacy preserving distributed mining algorithms mine distributed data while ensuring that one's private contribution to the global computation is not revealed. However, there are instances when such privacy assurances may fail. For example, if one's contribution happens to be an outlier, its data can be estimated from the globally mined data. In this paper we propose two simple protocols to address...
In this paper, the idea of the divide and conquer approach is used to develop a new fast exponentiation algorithm. The proposed algorithm is primarily based on the idea of merge sort. The analysis affirms that this proposed algorithm gives an improved performance in terms of the computing speed and the amount of memory utilized.
In this paper, the structures and properties of single cycle T-function, which has been lately proposed by Klimov and Shamir, are studied. A new symbol cij is introduced, which is called a carrier, to representing the carrier of the word x on jth position at ith time. By using the carriers, we reveal that the sequence composed of the values of the word x on jth position at all time, whose period...
Protecting the privacy of message receivers is an important issue in pay services of e-commerce and the distribution of digital contents on the Internet. This paper proposes an efficient privacy of message encryption algorithm called PMEA for pay services of e-commerce. In PMEA, each of the receivers only needs to perform constant times of pairing computation to decrypt the received message. PMEA...
The paper presents the second phase of a curriculum project that builds on existing successful work. Our work involves the development, implementation, and testing of an adaptable framework for the presentation of core AI topics that emphasizes the relationship between AI and computer science. Under phase 1, we developed and pilot-tested our proof-of-concept. The second phase involves further development...
In this paper, we propose an infinite class of Boolean functions with four-valued Walsh spectra. These functions have a simple trace expression of the form f(x) = trn1 (??d(2n+1)) + tr2n1(bx) for b ?? F22n and d satisfying d(2l +1) = 2i(mod 2n-1) with integers I and i, where x ?? F22n. Their cryptographic properties, including balancedness, spectrum distribution, nonlinearity, algebraic degree...
Security issues play an important role in modern communication worlds. Via distrusted networks, exchanged messages need to be encrypted by a session key for security requirements. Session keys are preferred to be generated by communication parties, and how to authenticate the other communication party is an important problem needed to be solved. In three-party encrypted key exchange (3PEKE) protocols,...
Visual secret sharing (VSS) schemes, providing secret communication services, are classified into two categories: visual-cryptography-based (VC) and random-grids-based (RG). As a friendly progressive version of VC-based VSS presented in 2008, it suffers the problem of pixel expansion which is innate deficiency of conventional VC-based VSS. In this paper, a new friendly progressive VSS scheme by random...
This paper generalizes de Weger's method if the ratio of two RSA primes p/q is close to a simple fraction b/a. We can discover the secret exponent d < N3/4gamma from the convergents of e/(N+1-(a+b)/radic(ab) radicN) for |ap- bq| = Ngamma. Our method is thus reduced to de Weger's method if a=b=1. When b/a = 1/2, our method is reduced to Maitra and Sarkar's method.
In this paper the concept of fuzzy IBE schemes with some fixed attributes (SAA-FIBE) is proposed and one construction of it is presented. SAA-FIBE scheme can be viewed as a variant of SW scheme described in which demanding no fixed positive or negative attributes. In our scheme, a user with identity omega can decrypt the message that is encrypted with a set of attributes, omega', if and only if |omega'...
In this paper we deal with the problem of an owner sending a message to a group of users such that some subset of users is considered revoked and should not be able to obtain the content of the message. We concentrate on the stateless receiver case, where the users do not update their state from session to session. Many broadcast encryption protocols require handshaking for the contents sharing. In...
Podaj zakres dat dla filtrowania wyświetlonych wyników. Możesz podać datę początkową, końcową lub obie daty. Daty możesz wpisać ręcznie lub wybrać za pomocą kalendarza.