China
Africa
Explore chapters and articles related to this topic
Physical Systems and Information Theory
Published in Günter Mahler, Volkhard May, Michael Schreiber, Molecular Electronics, 2020
Günter Mahler, Volkhard May, Michael Schreiber
Computers are special machines that implicitly define computability: computable operations are operations that can be represented physically. This implies a strange cyclic relationship between physical models and their mathematical codification: to be practically useful, physics should be formulated in terms of computable functions, which in turn are defined via physical models.
Blockchain-based anonymous authentication for traffic reporting in VANETs
Published in Connection Science, 2022
Bilinearity: , there exists , and .Non-degeneracy: , there exists , where represents the identity in .Computability: , bilinear pairing can be computed by an efficient algorithm.
Multi-copy dynamic cloud data auditing model based on IMB tree
Published in Enterprise Information Systems, 2021
Yifan Zhang, Guoyuan Lin, Hao Gu, Fu Zhuang, Guoying Wei
Bilinear mapping, it is a mathematical tool for verification of integrity aggregation evidence. It can be described by a quad . and are two prime order multiplicative cycle groups, whose order is a large prime . Defining a mapping relationship : , satisfying the following features (Kwangsu and Dong Hoon 2018; Deswarte, Quisquater, and Sadane 2004; Wang et al. 2016): Bilinear: For any and , .Non-degenerate: There is , such that . (represents the unit cell of ).Computability: There is a valid algorithm for calculating the value of for any .
Deniable authenticated encryption for e-mail applications
Published in International Journal of Computers and Applications, 2020
Chunhua Jin, Guanhua Chen, Changhui Yu, Jianyang Zhao
Let be a cyclic additive group generated by P, whose order is a prime q, and be a cyclic multiplicative group of the same order q. A bilinear pairings is a map which satisfies the following three properties: Bilinear: for all .Non-degeneracy: There exists such that .Computability: There is an efficient algorithm to compute for all .