- All Journals
- Al-Qadisiyah University
- Basrah University
- Kirkuk University
- Mosul University
- The Iraqi Borad for Medical Specialization
- University of Anbar
- University of Technology
- Al Mustafa University
- Al-Zahraa University for Women
- Alnoor University
- Kunooz University
- Misan University
- Ninevah University
- Tikrit University
- University of Al-Hamdaniya
- University of Kerbala
Computing Well Pairings For Elliptic Curve Group Points | ||
| Diyala Journal For Pure Science | ||
| Article 1, Volume 10, Issue 2, 2014, Pages 172-186 | ||
| Author | ||
| Shakir Mahmoud Salman | ||
| Abstract | ||
| This work introduce study for one of the relation between points on elliptic curve group which may can use it to attack some of elliptic curve cryptosystems kinds by solving the elliptic curve discrete logarithm problem ( ECDLP ) which are Weil pairings where we describe the basic concepts for elliptic curve group points operation and some type of elliptic curve that we can fined Weil pairing on it and also we explain all the terms concerning with this property and how to compute it by arithmetical example and introduce some of conclusions that we get it in this work . | ||
| Keywords | ||
| Elliptic Curve; pairing; divisor; rational function; weil pairings | ||
|
Statistics Article View: 210 PDF Download: 123 |
||