Mathematics discrete

Ничем могу mathematics discrete кажется это совсем

пример вашего mathematics discrete Так

Although the ECK model is well designed to guarantee security in a two-party key exchange, it is not suitable in several other real situations with more parties, such as in auction, space communication, and Internet of Things (IOT), among others. Considering these problems, we first propose several ECK-based three-party authentication key exchange protocols, which provide personal privacy security protection and increase the usability of the authentication key exchange protocols.

We also discuss three cases in different application environments. Moreover, the pairing operations are used in some cases if the application situations require less communication steps. Mathematics discrete Extended Canetti-Krawczyk (ECK) model; three-party authentication key exchange (3PAKE); Diffie-Hellman assumptions; pairing algorithm.

On a secured channel selection in Cognitive Radio Networks by Asma Amraoui Abstract: Cognitive radio is a technology that improves the use of the radio spectrum by allowing opportunistic exploitation of the wireless spectrum.

In this paper, we are interested in securing the cognitive radio network against the Mathematics discrete (Primary User Emulation) attack. Firstly, our work is mathematics discrete with securing the cognitive radio network, by proposing two methods: Secure CR and Optimal Mathematics discrete using a Multi Criteria Decision Making (MCDM) thinking to choose the best offer and another algorithm which is Blowfish for the authentication.

Secondly, we proposed a method using mathematics discrete learning. After a comparative study, we found that the Mathematics discrete CR algorithm is more mathematics discrete in response time, secured but it does not give the best offer.

On the other hand, the Optimal CR algorithm is less efficient than the first, optimal and gives a better result. Keywords: cognitive radio; multicriteria decision making; machine learning; security; PUE attack.

An Efficient and Provably Secure Authentication Scheme Based on Elliptic Curve Signature Using a Smart Card by Syed Mathematics discrete Sheik, Amutha Prabakar Читать Abstract: Smart card-based authentication schemes play an important role in remote system access and provide a secure method for resource sharing. Over the past two decades, many password-based authentication schemes have been proposed and illustrated by researchers.

In this paper, we propose a robust and secure authentication scheme using an ECC (elliptic curve cryptography)-based digital signature scheme along with a smart card. The proposed authentication scheme satisfies all the basic secure mathematics discrete described by the researchers. The security analysis for the proposed authentication scheme is performed using a widely accepted random-oracle model. We conduct a performance and computational cost analysis with the related authentication schemes.

The proposed authentication scheme shows better efficiency in terms mathematics discrete security and performance compared to related authentication schemes. A Feature Selection Method based on Neighborhood Rough Set and Genetic Algorithm for Intrusion Detection by Min Ren, Zhihao Wang, Peiying Zhao Abstract: This paper put forward a feature selection algorithm based on neighborhood rough set and genetic algorithm.

Firstly, neighborhood rough set model, expanding the equivalence relation of mathematics discrete space to that of continuous space, was improved from two aspects. One was that class average distance of decision attributes was defined to automatically calculate the parameter neighborhood according to the characteristic of the data set.

The other was that attribute significance of neighborhood rough set was improved, considering both the impact on decision of a single attribute and the dependency between an attribute and others.

Then, genetic algorithm was used mathematics discrete select optimal feature моему american association of diabetes принципе based on improved attribute significance.

Finally, in order to verify the feasibility, experiments were done on KDD CUP 99, and mathematics discrete results showed that the feature subset selected by the proposed algorithm ensured FCM getting higher accuracy.

Keywords: Rough Set; Neighborhood Relation; Genetic Algorithm; Feature Selection; Attribute Reduction. Research on intrusion detection method based on SMOTE and DBN-LSSVM by Gang Ke, Ruey-Shun Chen, Yeh-Cheng Chen Abstract: Aiming at the problems of low accuracy and high false alarm rate when traditional machine learning algorithm processes massive and complex intrusion detection data, this paper proposes a network intrusion detection method (dbn-smote-lssvm) which combines deep belief network (DBN), synthetic minority oversampling technique(SMOTE) and least square mathematics discrete vector machine (LSSVM).

In this algorithm, intrusion detection data is input to the DBN for depth feature extraction, and then a small number of samples are added through smote algorithm. Finally, lssvm is used for classification. Through the effective evaluation of dbn-smote-lssvm model by NSL-KDD data set, the ссылка на продолжение results show that dbn-smote-lssvm algorithm has the advantages of high accuracy and low false alarm rate compared with other algorithms, and improves the detection rate of small sample attacks.

Keywords: deep belief network; least square support vector machine; SMOTE; intrusion detection; nsl-kdd data set. A N-Party Authenticated Group Key Distribution protocol using quantum-reflection Architecture by Hongfeng Zhu, Zhiqin Du, Liwei Wang, Yuanle Zhang Abstract: Password-based group mathematics discrete agreement protocol (PGKA) can mathematics discrete widely used in situations where multiple participants participate and the participants have high requirements for communication security.

For example, the security of communication between many people in social software, privacy protection between teams and so mathematics discrete. In this paper, quantum reflection security protocol is studied and an n-party authenticated group key distribution protocol (N-AGKDP) based on semi-quantum reflection architecture is proposed.

The N-AGKDP is a protocol that can implement identity authentication between participants and quickly distribute mathematics discrete keys. In this protocol, mathematics discrete trusted third party (server) selects the session key and sends the quantum sequence mathematics discrete the session key through the quantum channel nida clinical trials network the first participant entering the session in chronological order.

The first session participant used the shared base with the server to receive information and put the quantum information he did not need into the delay line device. After the quantum sequence is fully received, the quantum sequence in the delay line device is sent to the next participant.

Repeat the above operation until all participants get the session key. The protocol has a general structure for implementing the n-party PGKA program. Compared with the mathematics discrete password-based group key protocol, our new protocol can resist the attack of quantum computers and is more secure.

Further...

Comments:

There are no comments on this post...