{"title":"一些新的最优配对","authors":"He Shang, Mingqiang Wang","doi":"10.1109/CIS.2010.90","DOIUrl":null,"url":null,"abstract":"The Ate pairing can be computed efficiently on ordinary elliptic curves with small value of the trace of Frobenius $\\bf t$. The ${\\bf Ate_i}$ pairing generalizes the Ate pairing, and can possibly shorten the Miller loop to be as small as ${\\bf r^{\\frac{1}{\\varphi(k)}}}$ on some special pairing-friendly curves with large value of Frobenius $\\bf t$. However, not all pairing-friendly curves have this property. In this paper, we generalize the ${\\bf Ate_i}$ pairing further. By our method, we can shorten the the Miller loop to be nearly ${\\bf r^{\\frac{1}{\\varphi(k)}}}$ on some pairing-friendly curves, while the ${\\bf Ate_i}$ pairing can not reach.","PeriodicalId":420515,"journal":{"name":"2010 International Conference on Computational Intelligence and Security","volume":"716 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Some New Optimal Pairings\",\"authors\":\"He Shang, Mingqiang Wang\",\"doi\":\"10.1109/CIS.2010.90\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The Ate pairing can be computed efficiently on ordinary elliptic curves with small value of the trace of Frobenius $\\\\bf t$. The ${\\\\bf Ate_i}$ pairing generalizes the Ate pairing, and can possibly shorten the Miller loop to be as small as ${\\\\bf r^{\\\\frac{1}{\\\\varphi(k)}}}$ on some special pairing-friendly curves with large value of Frobenius $\\\\bf t$. However, not all pairing-friendly curves have this property. In this paper, we generalize the ${\\\\bf Ate_i}$ pairing further. By our method, we can shorten the the Miller loop to be nearly ${\\\\bf r^{\\\\frac{1}{\\\\varphi(k)}}}$ on some pairing-friendly curves, while the ${\\\\bf Ate_i}$ pairing can not reach.\",\"PeriodicalId\":420515,\"journal\":{\"name\":\"2010 International Conference on Computational Intelligence and Security\",\"volume\":\"716 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-12-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 International Conference on Computational Intelligence and Security\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CIS.2010.90\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 International Conference on Computational Intelligence and Security","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CIS.2010.90","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The Ate pairing can be computed efficiently on ordinary elliptic curves with small value of the trace of Frobenius $\bf t$. The ${\bf Ate_i}$ pairing generalizes the Ate pairing, and can possibly shorten the Miller loop to be as small as ${\bf r^{\frac{1}{\varphi(k)}}}$ on some special pairing-friendly curves with large value of Frobenius $\bf t$. However, not all pairing-friendly curves have this property. In this paper, we generalize the ${\bf Ate_i}$ pairing further. By our method, we can shorten the the Miller loop to be nearly ${\bf r^{\frac{1}{\varphi(k)}}}$ on some pairing-friendly curves, while the ${\bf Ate_i}$ pairing can not reach.