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.
Outlier detection is a hot topic of data mining. After studying the existing classical algorithm of detecting outliers, this paper proposes a new algorithm for outlier detection based on offset, and makes a new definition for outlier. This detection algorithm is a method based on clustering analysis. It includes cluster modeling and data detection. Also, the clustering result obtained together with...
To determine the choice of information security solutions, the method based on entropy weight was given to compute the weights of indexes of the solutions. And then, the weights were used to evaluate the solutions by multi-attributes decision and ideal indexes method. The gray situation decision-making was introduced for solutions decision, and entropy weights were also used with gray solution decision...
A new three-party quantum secure direct communication protocol with authentication is proposed. The advantage of the scheme is that through authentication one can confirm the sender's legitimate identity, partially entangled states used as information carrier are easy to prepare and store, there is no need to transmit quantum states with secret message in quantum channel and two users can simultaneously...
Active shape model (ASM) is an efficient method for locating face feature points. When the face poses vary largely, it is difficult for the two-dimension (2D) transformation shape search method in previous works to cope with this kind of nonlinear shape variations. We propose a novel shape search method of the three-dimension (3D) transformation; and the variation of the face pose can simulated by...
Temporal logics of knowledge are useful for reasoning about situations where we require both dynamic aspects and informational aspects relating to knowledge. So, the application of temporal logics of knowledge is investigated to the specification and verification the properties of TLS protocol. Two main properties of TLS are given out. And the definitions and lemmas for the proof of these properties...
Since KASUMI algorithm is forbidden to use commercially in China, a new f8 keystream generator is presented by using SMS4 as core algorithm in this paper. Then the new f8 is implemented in software to produce 100 groups 20000-bit keystreams with different cipher keys. Later, FIPS 140-2 is applied to these keystreams to test randomness. Based on the data obtained, six figures are drawn to specify the...
The measurement principle and sensor structure of a new-style time-difference method ultrasonic flow meter are presented. Software waveform analyses arithmetic based on FPGA and a bran-new echo datum mark position criterion are put forward. Exact measurement time can be helpful for improving system precision. In the end, realization project is simply described.
A common misconception concerning Insider Threat is that the information infrastructure is at considerable risk from technical issues. In fact, Insider Threat is a multidisciplinary concept across many different fields, including personnel security, environment security and technology security. All aspects regarding Insider Threat must be addressed in a well-structured and holistic manner, failure...
First we revisit three (BGLS, MBGLS and GZZ) verifiably encrypted signature schemes. We find that they are all not strong unforgeable. We remark that the notion of existential unforgeable is not sufficient for fair exchange protocols in most circumstances. So we propose three new (NBGLS, MBGLS and NGZZ) verifiably encrypted signature schemes which are strong unforgeable. Also we reconsider other two...
To protect hard disk data confidentiality and integrity, AEIVV associates one unique IV with each disk sector; then, it applies authenticated encryption of AES-CCM to the protected sector and constructs hash tree upon IV storage. Through assuring IV to be trusted or un-tampered, data can be protected firmly. To make it an available way for disk protection, various optimizing measures are applied to...
Mobile code can be considered composing of functions. Sander et al implemented non-interactive evaluation of encrypted functions(non-interactive EEF) based on homomorphism. But their scheme is limited to encrypting polynomials in positive integer domain. There is no homomorphism that can securely implement non-interactive evaluation of encrypted elementary functions (non-interactive EEEF) in real...
Murakami and Nasako proposed a knapsack public key cryptosystem in 2008. They claimed that their proposal is secure against some known attacks. In this paper, we propose a cryptanalytic attack on the cryptosystem. We use a heuristic method to show that the secret key can be recovered with lattice reduction algorithms. Hence, their construction is insecure.
A new knapsack type public key cryptosystem is proposed by constructing an easy knapsack problem. The cryptosystem is shown to be secure against Shamir's key recovery attack in that it does not use a super-increasing knapsack sequence in the construction process. The cryptosystem is also invulnerable to low density attack in that it obtains a relatively high density. It is shown that the cryptosystem...
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.