QQ客服 官方微博 反馈留言

	Constructing Pairing-Friendly Elliptic Curves under Embedding Degree 1 for Securing Critical Infrastructures.
	Maocai Wang; Guangming Dai; Kim-Kwang Raymond Choo; Prem Prakash Jayaraman; Rajiv Ranjan
刊名	PLoS One
	2016
卷号	Vol.11 No.8页码:e0161857
ISSN号	1932-6203
URL标识	查看原文
内容类型	期刊论文
URI标识	http://www.corc.org.cn/handle/1471x/1863865
专题	南开大学
作者单位	School of Computer, China University of Geosciences, Wuhan, Hubei, China2Hubei Key Laboratory of Intelligent Geo-Information Processing, China University of Geosciences, Wuhan, Hubei, China3Department of Information Systems and Cyber Security, University of Texas at San Antonio, San Antonio, Texas, United States of America4RMIT University, Melbourne, Australia5University of Newcastle, Newcastle, United KingdomNankai University, CHINA
推荐引用方式 GB/T 7714	Maocai Wang,Guangming Dai,Kim-Kwang Raymond Choo,et al. Constructing Pairing-Friendly Elliptic Curves under Embedding Degree 1 for Securing Critical Infrastructures.[J]. PLoS One,2016,Vol.11 No.8:e0161857.
APA	Maocai Wang,Guangming Dai,Kim-Kwang Raymond Choo,Prem Prakash Jayaraman,&Rajiv Ranjan.(2016).Constructing Pairing-Friendly Elliptic Curves under Embedding Degree 1 for Securing Critical Infrastructures..PLoS One,Vol.11 No.8,e0161857.
MLA	Maocai Wang,et al."Constructing Pairing-Friendly Elliptic Curves under Embedding Degree 1 for Securing Critical Infrastructures.".PLoS One Vol.11 No.8(2016):e0161857.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。