找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Computational Intelligence and Security; International Confer Yue Hao,Jiming Liu,Yong-Chang Jiao Conference proceedings 2005 Springer-Verla

[复制链接]
查看: 18215|回复: 67
发表于 2025-3-21 16:12:02 | 显示全部楼层 |阅读模式
书目名称Computational Intelligence and Security
副标题International Confer
编辑Yue Hao,Jiming Liu,Yong-Chang Jiao
视频video
丛书名称Lecture Notes in Computer Science
图书封面Titlebook: Computational Intelligence and Security; International Confer Yue Hao,Jiming Liu,Yong-Chang Jiao Conference proceedings 2005 Springer-Verla
出版日期Conference proceedings 2005
关键词Bayesian networks; Fuzzy; architecture; cognition; computational intelligence; cryptographic protocols; da
版次1
doihttps://doi.org/10.1007/11596981
isbn_softcover978-3-540-30819-5
isbn_ebook978-3-540-31598-8Series ISSN 0302-9743 Series E-ISSN 1611-3349
issn_series 0302-9743
copyrightSpringer-Verlag Berlin Heidelberg 2005
The information of publication is updating

书目名称Computational Intelligence and Security影响因子(影响力)




书目名称Computational Intelligence and Security影响因子(影响力)学科排名




书目名称Computational Intelligence and Security网络公开度




书目名称Computational Intelligence and Security网络公开度学科排名




书目名称Computational Intelligence and Security被引频次




书目名称Computational Intelligence and Security被引频次学科排名




书目名称Computational Intelligence and Security年度引用




书目名称Computational Intelligence and Security年度引用学科排名




书目名称Computational Intelligence and Security读者反馈




书目名称Computational Intelligence and Security读者反馈学科排名




单选投票, 共有 0 人参与投票
 

0票 0%

Perfect with Aesthetics

 

0票 0%

Better Implies Difficulty

 

0票 0%

Good and Satisfactory

 

0票 0%

Adverse Performance

 

0票 0%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 21:14:10 | 显示全部楼层
https://doi.org/10.1007/978-3-642-41237-0 linear recurring length is always equal to the half of the length of the given sequence. The probability of finding the distribution of the shortest linear recurring length of two sequences in . / (.) field is also given.
发表于 2025-3-22 00:30:49 | 显示全部楼层
https://doi.org/10.1007/978-3-658-35515-9ns to construct polynomials over the intermediate extension field between .. and .. denoted by .. where . divides .. It turns out that many codes with the best parameters can be obtained by our construction and improve the parameters of Brouwer’s table [1]. Some codes we get are optimal by the Griesmer bound.
发表于 2025-3-22 05:27:16 | 显示全部楼层
发表于 2025-3-22 10:08:23 | 显示全部楼层
发表于 2025-3-22 14:42:28 | 显示全部楼层
发表于 2025-3-22 20:17:18 | 显示全部楼层
发表于 2025-3-22 23:11:55 | 显示全部楼层
发表于 2025-3-23 02:13:04 | 显示全部楼层
发表于 2025-3-23 09:04:38 | 显示全部楼层
Design of a New Kind of Encryption Kernel Based on RSA Algorithmtheorem is applied, which could quadruple the speed of the decryption and digital signature compared to the encryption. Furthermore, a new hardware model of the encryption kernel based on the ameliorative Montgomery is founded whose correctness and feasibility is validated by Verilog HDL in practice.
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-7-2 13:48
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表