找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Advances in Cryptology – EUROCRYPT ‘91; Workshop on the Theo Donald W. Davies Conference proceedings 1991 Springer-Verlag Berlin Heidelberg

[复制链接]
查看: 44365|回复: 65
发表于 2025-3-21 19:32:24 | 显示全部楼层 |阅读模式
期刊全称Advances in Cryptology – EUROCRYPT ‘91
期刊简称Workshop on the Theo
影响因子2023Donald W. Davies
视频video
学科分类Lecture Notes in Computer Science
图书封面Titlebook: Advances in Cryptology – EUROCRYPT ‘91; Workshop on the Theo Donald W. Davies Conference proceedings 1991 Springer-Verlag Berlin Heidelberg
影响因子A series of open workshops devoted to modem cryptology began in Santa Barbara, California in 1981 and was followed in 1982 by a European counterpart in Burg Feurstein, Germany. The series has been maintained with summer meetings in Santa Barbara and spring meetings somewhere in Europe. At the 1983 meeting in Santa Barbara the International Association for Cryptologic Research was launched and it now sponsors all the meetings of the series. Following the tradition of the series, papers were invited in the form of extended abstracts and were reviewed by the programme committee, which selected those to be presented. After the meeting, full papers were produced, in some cases with impro- ments and corrections. These papers form the main part of the present volume. They are placed in the same order that they took at the meeting and under the same headings, for ease of reference by those who attended. The classification under these headings was a little arbitary, needing to fit the timing of the day‘s activities, but it makes a workable method of arrangement. Also following tradition, a “rump session’’ was held during one evening, under the effective chairmanship of John Gordon. These we
Pindex Conference proceedings 1991
The information of publication is updating

书目名称Advances in Cryptology – EUROCRYPT ‘91影响因子(影响力)




书目名称Advances in Cryptology – EUROCRYPT ‘91影响因子(影响力)学科排名




书目名称Advances in Cryptology – EUROCRYPT ‘91网络公开度




书目名称Advances in Cryptology – EUROCRYPT ‘91网络公开度学科排名




书目名称Advances in Cryptology – EUROCRYPT ‘91被引频次




书目名称Advances in Cryptology – EUROCRYPT ‘91被引频次学科排名




书目名称Advances in Cryptology – EUROCRYPT ‘91年度引用




书目名称Advances in Cryptology – EUROCRYPT ‘91年度引用学科排名




书目名称Advances in Cryptology – EUROCRYPT ‘91读者反馈




书目名称Advances in Cryptology – EUROCRYPT ‘91读者反馈学科排名




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

0票 0.00%

Perfect with Aesthetics

 

1票 100.00%

Better Implies Difficulty

 

0票 0.00%

Good and Satisfactory

 

0票 0.00%

Adverse Performance

 

0票 0.00%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 21:28:59 | 显示全部楼层
发表于 2025-3-22 00:53:06 | 显示全部楼层
Springer-Verlag Berlin Heidelberg 1991
发表于 2025-3-22 05:48:04 | 显示全部楼层
Boom Then Bust at the George HotelIn [.,.] we introduced the notion of differential cryptanalysis and described its application to DES [.] and several of its variants. In this paper we show the applicability of differential cryptanalysis to the Feal family of encryption algorithms and to the N-Hash hash function.
发表于 2025-3-22 12:27:19 | 显示全部楼层
Rutool Sharma,Ravi S. SannabhadtiThe Ziv-Lempel complexity is a well-known complexity measure. In our paper we consider the Ziv-Lempel complexity for periodic sequences as well as for pseudorandom number sequences. Further on, we will look at its cryptographic significance and compare it with other complexity measures such as the linear complexity.
发表于 2025-3-22 16:50:53 | 显示全部楼层
发表于 2025-3-22 19:04:07 | 显示全部楼层
Oscar Vorobjovas-Pinta,Violetta Wilknalysis is a chosen-plaintext attack on secret-key block ciphers that are based on iterating a cryptographically weak function r times (e.g., the 16-round Data Encryption Standard (DES)). It is shown that the success of such attacks on an r-round cipher depends on the existence of (r-1)-round differ
发表于 2025-3-23 00:33:10 | 显示全部楼层
Oscar Vorobjovas-Pinta,Violetta Wilkrithm can break this scheme with a number in the region of 2. computations. That number of operations is feasible in realistic time with modern computers. Thus the proposed hash function is not very secure. Among those computations a substantial number can be performed once for all. A faster result
发表于 2025-3-23 02:22:09 | 显示全部楼层
发表于 2025-3-23 09:13:39 | 显示全部楼层
Oscar Vorobjovas-Pinta,Violetta Wilkation algorithm for decoding an arbitrary linear code. The algorithm provides guaranteed correction of all error patterns with Hamming weight less than d/2, where d is the minimum distance of the code, and has time complexity about O(n.) where n is the block length. The approach is illustrated by th
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-10 12:00
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表