找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Information Security and Cryptology - ICISC 2003; 6th International Co Jong-In Lim,Dong-Hoon Lee Conference proceedings 2004 Springer-Verla

[复制链接]
楼主: hearken
发表于 2025-3-26 22:07:17 | 显示全部楼层
New Methods to Construct Cheating Immune Functionsite field is proposed, we then present the conditions for this type of balanced quadratic functions can be used in the construction of cheating immune functions. The cryptographic characteristics of these functions are also discussed.
发表于 2025-3-27 01:31:30 | 显示全部楼层
发表于 2025-3-27 07:55:29 | 显示全部楼层
发表于 2025-3-27 10:58:24 | 显示全部楼层
发表于 2025-3-27 15:55:56 | 显示全部楼层
发表于 2025-3-27 21:33:10 | 显示全部楼层
A Separable Threshold Ring Signature Scheme particular type of public keys, as required by all the previous schemes. In the paper, we also show that the signature maintains the anonymity of participating signers unconditionally and is existential unforgeable against chosen message attacks in the random oracle model.
发表于 2025-3-28 00:08:48 | 显示全部楼层
An Efficient Strong Designated Verifier Signature Schemeeme is the low communication and computational cost. Generating a signature requires only one modular exponentiation, while this amount is two for the verification. Also, a signature in our scheme is more than four times shorter than those of known designated verifier schemes.
发表于 2025-3-28 04:21:34 | 显示全部楼层
发表于 2025-3-28 07:50:53 | 显示全部楼层
Implementation of Tate Pairing on Hyperelliptic Curves of Genus 2ic curves of genus 2. We have computed Tate parings on a supersingular hyperelliptic curve over prime fields and the detailed algorithms are explained. This is the first attempt to present the implementation results for Tate pairing on a hyperelliptic curve of genus bigger than 1.
发表于 2025-3-28 12:54:36 | 显示全部楼层
Efficient Scalar Multiplication in Hyperelliptic Curves Using A New Frobenius Expansionter, while the number of divisor additions is almost the same. Our experiments show that the overall throughputs of scalar multiplications are increased by 15.6–28.3% over the previous algorithm, when the algorithms are implemented over finite fields of odd characteristics.
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-23 15:46
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表