找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Cryptography and Coding; 10th IMA Internation Nigel P. Smart Conference proceedings 2005 Springer-Verlag Berlin Heidelberg 2005 Signcryptio

[复制链接]
查看: 6838|回复: 65
发表于 2025-3-21 20:05:20 | 显示全部楼层 |阅读模式
书目名称Cryptography and Coding
副标题10th IMA Internation
编辑Nigel P. Smart
视频videohttp://file.papertrans.cn/241/240568/240568.mp4
丛书名称Lecture Notes in Computer Science
图书封面Titlebook: Cryptography and Coding; 10th IMA Internation Nigel P. Smart Conference proceedings 2005 Springer-Verlag Berlin Heidelberg 2005 Signcryptio
出版日期Conference proceedings 2005
关键词Signcryption; authentication; coding; coding theory; cryptanalysis; cryptographic attacks; cryptography; cr
版次1
doihttps://doi.org/10.1007/11586821
isbn_softcover978-3-540-30276-6
isbn_ebook978-3-540-32418-8Series ISSN 0302-9743 Series E-ISSN 1611-3349
issn_series 0302-9743
copyrightSpringer-Verlag Berlin Heidelberg 2005
The information of publication is updating

书目名称Cryptography and Coding影响因子(影响力)




书目名称Cryptography and Coding影响因子(影响力)学科排名




书目名称Cryptography and Coding网络公开度




书目名称Cryptography and Coding网络公开度学科排名




书目名称Cryptography and Coding被引频次




书目名称Cryptography and Coding被引频次学科排名




书目名称Cryptography and Coding年度引用




书目名称Cryptography and Coding年度引用学科排名




书目名称Cryptography and Coding读者反馈




书目名称Cryptography and Coding读者反馈学科排名




单选投票, 共有 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 20:46:18 | 显示全部楼层
发表于 2025-3-22 01:43:31 | 显示全部楼层
发表于 2025-3-22 04:54:07 | 显示全部楼层
A Trellis-Based Bound on (2,1)-Separating Codes codes find applications in digital fingerprinting and broadcast encryption for example. We conjecture some bounds on the higher weights, whose proof would considerably strengthen the upper bound on the rate of (2,1)-separating codes.
发表于 2025-3-22 11:56:55 | 显示全部楼层
Hash Based Digital Signature Schemesplications, but their importance may increase if ever a practical quantum computer was built. We discuss issues related to both their implementation and their security. As far as we are aware this is the first complete treatment of practical implementations of hash based signature schemes in the literature.
发表于 2025-3-22 14:01:41 | 显示全部楼层
发表于 2025-3-22 19:29:14 | 显示全部楼层
Partial Key Recovery Attacks on XCBC, TMAC and OMACs against all three of these schemes are described, yielding upper bounds on the effective security level. The results imply that there is relatively little to be gained practically through the introduction of these schemes by comparison with other well-established MAC functions.
发表于 2025-3-22 23:21:16 | 显示全部楼层
https://doi.org/10.1007/978-981-99-6222-8 For example, one can prove a lower bound on the complexity of computing discrete logarithms in a cyclic group if one considers only generic algorithms which can not exploit the properties of the representation of the group elements..We propose an abstract model of computation which allows to captur
发表于 2025-3-23 03:29:23 | 显示全部楼层
Web Information Systems and Applicationss area was the elegant solution by Boneh and Franklin [8] of the problem of efficient identity-based encryption. At the same time, the security standards for public key cryptosystems are expected to increase, so that in the future they will be capable of providing security equivalent to 128-, 192-,
发表于 2025-3-23 08:16:33 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 吾爱论文网 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
QQ|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-8-26 07:14
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表