密码学进展—CT-RSA 2001Topics in cryptology
点此进入淘宝搜索页搜索分類: 图书,计算机/网络,信息安全,
作者： David Naccache 著
出 版 社： 湖南文艺出版社
出版时间： 2001-12-1字数：版次： 1页数： 470印刷时间： 2006/12/01开本：印次：纸张： 胶版纸I S B N ： 9783540418986包装： 平装编辑推荐
The LNCS series reports state-of-the-art results in computer science research, development, and education, at a high level and in both printed and electronic form. Enjoying tight cooperation with the R&D community, with numerous individuals, as well as with prestigious organizations and societies, LNCS has grown into the most comprehensive computer science resarch forum available.
The scope of LNCS, including its subseries LNAI, spans the whole range of computer science and information technology including interdisciplinary topics in a variety of application fields. The type of material publised traditionally includes.
-proceedings(published in time for the respective conference)
-post-proceedings(consisting of thoroughly revised final full papers)
-research monographs(which may be basde on outstanding PhD work, research projects, technical reports, etc.)
内容简介
This book constitutes the refereed proceedings of the Cryptographers' Track at RSA Conference 2001, CT-RSA 2001, in San Francisco, CA, USA in April 2001.The 33 revised full papers presented were carefully reviewed and selected from 65 submissions. The papers are organized in topical sections on new cryptosystems; RSA; symmetric cryptography; gambling and lotteries; reductions, constructions, and security proofs; flaws and attacks; implementation; multivariate cryptography; number theoretic problems; passwords and credentials; and protocols.
目录
New Cryptosystems
Faster Generation of NICE-Schnorr-Type Signatures
New Key Agreement Protocols in Braid Group Cryptography
RSA
Improving SSL Handshake Performance via Batching
From Fixed-Length Messages to Arbitrary-Length Messages Practical RSASignature Padding Schemes
An Advantage of Low-Exponent RSA with Modulus Primes Sharing LeastSignificant Bits
Symmetric Cryptography
On the Strength of Simply-Iterated Feistel Ciphers with Whitening Keys
Analysis of SHA-1 in Encryption Mode
Fast Implementation and Fair Comparison of the Final Candidates forAdvanced Encryption Standard Using Field Programmable Gate Arrays
Gambling and Lotteries
Fair e-Lotteries and e-Casinos
Secure Mobile Gambling
Reductions, Constructions and Security Proofs
Formal Security Proofs for a Signature Scheme with Partial MessageRecovery
The Oracle Diffie-Hellman Assumptions and an Analysis of DHIES
REACT: Rapid Enhanced-Security Asymmetric Cryptosystem Transform
Flaws and Attacks
Security Weaknesses in Bluetooth
Distinguishing Exponent Digits by Observing Modular Subtractions
On the Power of Misbehaving Adversaries and Security Analysis of theOriginal EPOC
Implementation
Modular Exponentiation on Fine-Grained FPGA
……
Multivariate Cryptography
Number Theoretic Problems
Protocols I
Protocols I
Author Index
