粗鲁的人
发表于 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.
gerontocracy
发表于 2025-3-27 01:31:30
http://reply.papertrans.cn/47/4654/465373/465373_32.png
START
发表于 2025-3-27 07:55:29
http://reply.papertrans.cn/47/4654/465373/465373_33.png
Mnemonics
发表于 2025-3-27 10:58:24
http://reply.papertrans.cn/47/4654/465373/465373_34.png
Exterior
发表于 2025-3-27 15:55:56
http://reply.papertrans.cn/47/4654/465373/465373_35.png
gastritis
发表于 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.
Minatory
发表于 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
http://reply.papertrans.cn/47/4654/465373/465373_38.png
常到
发表于 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.