Group Structure of Special Parabola and Its Application in Cryptography
Issue:
Volume 8, Issue 6, December 2019
Pages:
88-94
Received:
5 November 2019
Accepted:
28 November 2019
Published:
9 December 2019
Abstract: Public key cryptography is one of the most important research contents in modern cryptography. Curve-based public key cryptosystems have attracted widespread attention in recent years because they have more obvious advantages in speed and key length than general public key cryptosystems. People have done a lot of research on elliptic cryptosystem, among which the realization of elliptic cryptosystem is a key content. In this paper, the definition of special parabola in algebraic closed domain is proposed, the group structure of special parabola in finite field is studied, and several forms of public key cryptosystem based on this parabola are given. The results show that the parabola, together with the additive operations defined above, form an Abelian group. The radix of this parabola can be easily determined, so that the factors it contains can be large prime. The security of its public key cryptosystem is based on the difficulty of solving the discrete logarithm problem on this parabola. Moreover, these parabolic public key cryptosystems are easy to code and decode in plaintext, and easier to design and implement than elliptic curve public key cryptosystems.
Abstract: Public key cryptography is one of the most important research contents in modern cryptography. Curve-based public key cryptosystems have attracted widespread attention in recent years because they have more obvious advantages in speed and key length than general public key cryptosystems. People have done a lot of research on elliptic cryptosystem, ...
Show More
Screening out All Valid Aristotelian Modal Syllogisms
Issue:
Volume 8, Issue 6, December 2019
Pages:
95-104
Received:
5 January 2020
Accepted:
15 January 2020
Published:
13 February 2020
Abstract: It is easy to understand that whether a classical syllogism is valid. That whether a modal syllogism is valid is not so transparent. The prevailing view on Aristotelian modal syllogistic is that the syllogistic is incomprehensible due to its many faults and inconsistencies. Although adequate semantic analysis or reconstruction of the syllogistic have be given by many authors, it is far from obvious how to extend these results so as to consistently cover the whole modal syllogistic developed. The major aim of this paper is to overcome these difficulties, and screen out 384 Aristotelian valid modal syllogisms from 6656 Aristotelian modal syllogisms in natural language. They can be formalized by means of set theory and generalized quantifier theory, and their validity can be proved by possible world semantics and the truth definition of Aristotelian quantifiers defined in generalized quantifier theory. The basic steps of screening out all valid Aristotelian modal syllogisms are as follows: firstly one can get all possible modal syllogisms obtained by adding modal operators to 24 valid classical syllogisms, and secondly eliminate invalid modal syllogisms by characteristic rules of modal syllogisms. It is hoped that these innovative achievements will make contributions to promote the development of Aristotelian and generalized modal syllogistic, natural language information processing, and further research on knowledge representation and knowledge reasoning in computer science.
Abstract: It is easy to understand that whether a classical syllogism is valid. That whether a modal syllogism is valid is not so transparent. The prevailing view on Aristotelian modal syllogistic is that the syllogistic is incomprehensible due to its many faults and inconsistencies. Although adequate semantic analysis or reconstruction of the syllogistic ha...
Show More
