找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Arithmetic of Finite Fields; First International Claude Carlet,Berk Sunar Conference proceedings 2007 Springer-Verlag Berlin Heidelberg 20

[复制链接]
楼主: GOLF
发表于 2025-4-1 03:57:34 | 显示全部楼层
Towards Optimal Toom-Cook Multiplication for Univariate and Multivariate Polynomials in Characteristis proposed to find the faster Toom multiplication algorithm for any given splitting order. New results found with it, for polynomials in characteristic 2, are presented..A new extension for multivariate polynomials is also introduced; through a new definition of density leading Toom strategy to be efficient.
发表于 2025-4-1 08:37:39 | 显示全部楼层
The Simplest Method for Constructing APN Polynomials EA-Inequivalent to Power Functionsns. In the present paper we prove that the answer to this question is positive. By this method we construct a class of APN polynomials EA-inequivalent to power functions. On the other hand it is shown that the APN polynomials constructed by Budaghyan, Carlet and Pott cannot be obtained by the introduced method.
发表于 2025-4-1 11:58:46 | 显示全部楼层
发表于 2025-4-1 16:32:18 | 显示全部楼层
https://doi.org/10.1007/978-1-4302-6008-0(CRCs), linear feedback shift-registers (LFSRs), and implementations of the Advanced Encryption Standard (AES) algorithm. As the proposed algorithm can utilize cancellation of terms it outperforms in general previously proposed algorithms based on sub-expression sharing.
发表于 2025-4-1 20:45:30 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-11 03:39
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表