نتایج جستجو برای: pairing

تعداد نتایج: 26689  

Journal: :IACR Cryptology ePrint Archive 2013
Seunghwan Chang Hoon Hong Eunjeong Lee Hyang-Sook Lee

The security of pairing-based cryptosystems is closely related to the difficulty of the pairing inversion problem. Building on previous works, we provide further contributions on the difficulty of pairing inversion. In particular, we revisit the approach of Kanayama-Okamoto who modified exponentiation inversion and Miller inversion by considering an “auxiliary” pairing. First, by generalizing a...

2012
Kentaro Nabeshima

In preparation for meiotic chromosome segregation, homologous chromosomes need to pair, synapse (i.e., assemble the synaptonemal complex, SC), and then recombine to generate a physical linkage (i.e., chiasma) between them. In many organisms meiotic pairing capacity distributed along the entire chromosome length supports presynaptic alignment. In contrast, the prevailing model for C. elegans pro...

2010
Chiu-Hung Chen Ta-Yuan Chou Tung-Kuan Liu Jyh-Horng Chou Chung-Nan Lee

Airline crew pairing problems involve optimizing an overall evaluation function containing various conflicting objectives and constraints originating from cost and safety considerations. Classical approaches based on set partitioning or set covering methods separate the solution into two phases, pairing generation and pairing optimization, and evaluate the cost by a weighted-sum of objective va...

2005
Zhaohui Cheng Manos Nistazakis

Pairing-based cryptosystems have been developing very fast in the last few years. As the key primitive, pairing is also the heaviest operation in these systems. The performance of pairing affects the application of the schemes in practice. In this report, we summarise the formulas of the Tate pairing operation on elliptic curves in different coordinate systems and describe a few observations of...

2001
Gun Sang Jeon Lan Yin Sung Wu Rhee David J. Thouless

We study the Evans-Imry pairing phase of dilute homogeneous bose gas with attractive interaction. We find that it is generally unstable against fluctuations in pairing. Therefore in addition to the well-known mechanical collapse, the system can also collapse due to the pairing instability. Under certain conditions the critical temperature of pairing instability can be higher than that of mechan...

A. Aliabadi B. Sohrabi H. Aghaie M. Aghaie M. R. Sohrabi

The ion-pair association constant values, related to the reaction +  were determined by means of the NMR spectroscopy. The values of the thermodynamic functions of the ion pairing process were calculated on the basis of the NMR results. In addition, the association entropy was found to be dependent on the temperature. Comparing the experimental data and the Fuoss theory it is found that  ion-pa...

Journal: :international journal of industrial engineering and productional research- 0
mohammad reisi department of industrial and systems engineering, isfahan university of technology, isfahan, iran, postal code: 84156-83111 ghasem moslehi department of industrial and systems engineering, isfahan university of technology, isfahan, iran, postal code: 84156-83111

increasing competition in the air transport market has intensified active airlines’ efforts to keep their market share by attaching due importance to cost management aimed at reduced final prices. crew costs are second only to fuel costs on the cost list of airline companies. so, this paper attempts to investigate the cockpit crew pairing problem. the set partitioning problem has been used for ...

2009
Kenta NEKADO Hidehiro KATO Yasuyuki NOGAMI Yoshitaka MORIKAWA

Recently, pairing–based cryptographies have attracted much attention. For fast pairing calculation, not only pairing algorithms but also arithmetic operations in extension field should be efficient. Especially for final exponentiation included in pairing calculation, squaring is more important than multiplication. This paper proposes an efficient squaring algorithm in extension field for Freema...

Journal: :IACR Cryptology ePrint Archive 2007
Christine Abegail Antonio Satoru Tanaka Ken Nakamula

In this paper, we will implement a standard probabilistic method of computing bilinear pairings. We will compare its performance to a deterministic algorithm introduced in [5] to compute the squared Tate/Weil pairings which are claimed to be 20 percent faster than the standard method. All pairings will be evaluated over pairing-friendly ordinary elliptic curves of embedding degrees 8 and 10 and...

Journal: :Asian Journal of Mathematics 2000

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید