找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Cryptography and Coding; 13th IMA Internation Liqun Chen Conference proceedings 2011 Springer-Verlag GmbH Berlin Heidelberg 2011 anonymous

[复制链接]
查看: 29836|回复: 61
发表于 2025-3-21 18:09:10 | 显示全部楼层 |阅读模式
书目名称Cryptography and Coding
副标题13th IMA Internation
编辑Liqun Chen
视频video
概述State-of-the-art research.Fast-track conference proceedings.Unique visibility
丛书名称Lecture Notes in Computer Science
图书封面Titlebook: Cryptography and Coding; 13th IMA Internation Liqun Chen Conference proceedings 2011 Springer-Verlag GmbH Berlin Heidelberg 2011 anonymous
描述This book constitutes the refereed proceedings of the 13th IMA International Conference on Cryptography and Coding, IMACC 2011, held in Oxford, UK in December 2011. The 27 revised full papers presented together with one invited contribution were carefully reviewed and selected from 57 submissions. The papers cover a wide range of topics in the field of mathematics and computer science, including coding theory, homomorphic encryption, symmetric and public key cryptosystems, cryptographic functions and protocols, efficient pairing and scalar multiplication implementation, knowledge proof, and security analysis.
出版日期Conference proceedings 2011
关键词anonymous credentials; digital signatures; hidden vector encryption; identity-based encryption; steganog
版次1
doihttps://doi.org/10.1007/978-3-642-25516-8
isbn_softcover978-3-642-25515-1
isbn_ebook978-3-642-25516-8Series ISSN 0302-9743 Series E-ISSN 1611-3349
issn_series 0302-9743
copyrightSpringer-Verlag GmbH Berlin Heidelberg 2011
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 21:24:37 | 显示全部楼层
Improved Key Generation for Gentry’s Fully Homomorphic Encryption Schemei provided a fast technique for 2-power cyclotomic fields. We present an extension of the Gentry–Halevi key generation technique for arbitrary cyclotomic fields. Our new method is roughly twice as efficient as the previous best methods. Our estimates are backed up with experimental data.
发表于 2025-3-22 01:21:48 | 显示全部楼层
发表于 2025-3-22 06:36:52 | 显示全部楼层
发表于 2025-3-22 11:16:48 | 显示全部楼层
Binary Kloosterman Sums with Value 4 theory..Very recently Mesnager has showed that the value 4 of binary Kloosterman sums gives rise to several infinite classes of bent functions, hyper-bent functions and semi-bent functions in even dimension..In this paper we analyze the different strategies used to find zeros of binary Kloosterman
发表于 2025-3-22 16:56:07 | 显示全部楼层
发表于 2025-3-22 20:09:15 | 显示全部楼层
发表于 2025-3-22 22:55:47 | 显示全部楼层
发表于 2025-3-23 03:46:36 | 显示全部楼层
发表于 2025-3-23 08:21:29 | 显示全部楼层
The Symbiosis between Collision and Preimage Resistanceyet flexible enough to be of use for most applications. We give an in-depth analysis of existing preimage resistance notions, introduce several new notions, and establish relations and separations between the known and new preimage notions. This establishes a clear separation between domain-oriented
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-5 00:27
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表