| タイトル | Improved MACs from Differentially - Uniform Permutations |
|---|---|
| 著者 | 峯松 一彦 、松嶋 敏泰 |
| 年度 | 2007 |
| 形式 | 論文誌 |
| 分野 | 情報セキュリティ |
| 掲載雑誌名 | IEICE Trans. Fundamentals |
| 掲載号・ページ | vol.E90-A, no.12, pp.2908-2915 |
| 掲載年 | 2007 |
| 掲載月 | 12 |
| アブスト （日本語） |
査読：有 DOI：10.1093/ietfec/e90-a.12.2908 |
| アブスト （英語） |
This paper presents Message Authentication Codes (MACs) that combine a block cipher and its component such as a reduced-round version. Our MACs are faster than the standard MAC modes such as CBC-MAC, and provably secure if the block cipher is pseudorandom and its component is a permutation with a small differential probability. Such a MAC scheme was recently proposed by one of authors, and we provide improvements about security and treading-off between speed and amount of preprocessing. |
| 備考 （日本語） |
3 |
| 備考 （英語） |
3 |
| 論文原稿 | |
| 発表資料 |
関連論文
- A New Latent Class Model for Analysis of Purchasing and Browsing Histories on EC Sites
- Linear Programming Decoding of Binary Linear Codes for Symbol-Pair Read Channels
- A Heuristic Search Method with the Reduced List of Test Error Patterns for Maximum Likelihood Decoding
- Parallel Architecture for Generalized LFSR in LSI Built-In Self Testing
- Parallel Encoder and Decoder Architecture for Cyclic Codes
- A Generalization of B.S.Clarke and A.R.Barron's Asymptotics of Bayes Codes for FSMX Sources
- Almost Sure and Mean Convergence of Extended Stochastic Complexity
- A Source Model with Probability Distribution over Word Set and Recurrence Time Theorem
- Properties of a Word-Valued Source with a Non-prefix-free Word Set
- Asymptotics of Bayesian Inference for a Class of Probabilistic Models under Misspecification
- An Analysis of Slepian-Wolf Coding Problem Based on the Asymptotic Normality
- On the Overflow Probability of Fixed - to - Variable Length Codes with Side Information
- A Study on the Degrees of Freedom in an Experimental Design Model Based on an Orthonormal System
- A Note on Relation between the Fourier Coefficients and the Effects in the Experimental Design
- Asymptotic property of universal lossless coding for independent piecewise identically distributed sources
- A Note on the Linear Programming Decoding of Binary Linear Codes for Multiple-Access Channel
- A Note on Automatic Construction Algorithms for Orthogonal Designs of Experiments Using Error-correcting Codes
- A Note on the Branch-and-Cut Approach to Decoding Linear Block Codes
- Estimation of the Effects in the Experimental Design using Fourier Transforms
- A Note on a Sampling Theorem for Functions over $GF(q)^n$ Domain
