找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Arithmetic of Finite Fields; Second International Joachim Gathen,José Luis Imaña,Çetin Kaya Koç Conference proceedings 2008 Springer-Verlag

[复制链接]
楼主: 审美家
发表于 2025-3-23 12:58:40 | 显示全部楼层
发表于 2025-3-23 17:36:31 | 显示全部楼层
Montgomery Ladder for All Genus 2 Curves in Characteristic 2this method was known for elliptic curves and for genus 2 curves in odd characteristic. We obtain an algorithm that is competitive compared to usual methods of scalar multiplication and that has additional properties such as resistance to simple side-channel attacks. Moreover it provides a significa
发表于 2025-3-23 21:03:16 | 显示全部楼层
On Cryptographically Significant Mappings over GF(2,) that takes . binary inputs whose image is a binary .-tuple; therefore it is represented as .. One of the most important cryptographic applications is the case . = ., thus the S-box may be viewed as a function over .. We show that certain classes of functions over . do not possess a cryptographic pr
发表于 2025-3-24 00:49:15 | 显示全部楼层
Conference proceedings 2008ections on structures in finite fields, efficient finite field arithmetic, efficient implementation and architectures, classification and construction of mappings over finite fields, and codes and cryptography.
发表于 2025-3-24 04:11:45 | 显示全部楼层
0302-9743 topical sections on structures in finite fields, efficient finite field arithmetic, efficient implementation and architectures, classification and construction of mappings over finite fields, and codes and cryptography.978-3-540-69498-4978-3-540-69499-1Series ISSN 0302-9743 Series E-ISSN 1611-3349
发表于 2025-3-24 07:26:47 | 显示全部楼层
Basics of Expert System Technology, any support for finite fields. The computation of the primitive element in Maxima is now faster than in Axiom. Our package provides a more user-friendly interface for teaching than other comparable systems.
发表于 2025-3-24 12:24:58 | 显示全部楼层
K. P. Valavanis,S. G. Tzafestasnt speed-up of scalar multiplication in many cases. This new algorithm has very important applications in cryptography using hyperelliptic curves and more particularly for people interested in cryptography on embedded systems (such as smart cards).
发表于 2025-3-24 15:12:17 | 显示全部楼层
Efficient Finite Fields in the Maxima Computer Algebra System any support for finite fields. The computation of the primitive element in Maxima is now faster than in Axiom. Our package provides a more user-friendly interface for teaching than other comparable systems.
发表于 2025-3-24 20:59:10 | 显示全部楼层
发表于 2025-3-25 02:07:11 | 显示全部楼层
0302-9743 Siena, Italy, in July 2008. The 16 revised full papers presented were carefully reviewed and selected from 34 submissions. The papers are organized in topical sections on structures in finite fields, efficient finite field arithmetic, efficient implementation and architectures, classification and co
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-15 22:18
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表