New bound for affine resolvable designs and its application to authentication codes
スポンサーリンク
概要
- 論文の詳細を見る
本論文では、まず、"affine"(α_1,…,α_t)-resolvable designにおいて、b≦v+t-1が成り立つことを示す。ただし、bはブロック数、vはシンボル数、tはクラスの数を表す。この不等式は、"balanced" (α_1,…,α_t)-resolvable designにおいてよく知られているb≧u+t-1という不等式と、対をなすものである。次に、この不等式を調停者有り認証系に応用し、従来より厳しい鍵サイズの下限を示す。より具体的には、ある適当な仮定のもとで、受信者の鍵がaffine α-resolvable design (α_1=…=α_t=α)の構造を有し、vが鍵の数に対応することを示している。
- 社団法人電子情報通信学会の論文
- 1995-12-15
著者
-
Kurosawa Kaoru
Department Of Computer And Information Sciences Ibaraki University
-
KAGEYAMA Sanpei
Department of Mathematics, Faculty of Science, Hiroshima University
-
Kurosawa Kaoru
Department Of Electrical And Electronic Engineering Tokyo Institute Of Technology
-
Kurosawa Kaoru
Department Of Behavioral Sciences Faculty Of Letters Chiba University
-
Kageyama Sanpei
Department Of Mathematics Hiroshima University
-
Kageyama Sanpei
Department Of Mathematics Faculty Of Science Hiroshima University
関連論文
- On the Security of a MAC by Mitchell(Symmetric Key Cryptography)(Cryptography and Information Security)
- TMAC: Two-Key CBC MAC (Symmetric Cipher) (Cryptography and Information Security)
- TMAC : Two-Key CBC MAC
- Combinatorial Bounds and Design of Broadcast Authentication (Special Section on Discrete Mathematics and Its Applications)
- A Network Game Based on Fair Random Numbers(Cyberworlds)
- A Scheme for Partial Disclosure of Transaction Log(Application)(Cryptography and Information Security)
- On the Correctness of Security Proofs for the 3GPP Confidentiality and Integrity Algorithms(Discrete Mathematics and Its Applications)
- How to Design Efficient Multiple-Use 1-out-n Oblivious Transfer (Protocol) (Cryptography and Information Security)
- Hoe to Improve Interpolation Attack(Symmetric Key Cryptography)(Cryptography and Information Security)
- On the Pseudorandomness of KASUMI Type Permutations(Discrete Mathematics and Its Applications)
- Inclusion Relations of Boolean Functions Satisfying PC(l) of Order k(Special Section on Cryptography and Information Security)
- FURTHER CONSTRUCTIONS OF NESTED GROUP DIVISIBLE DESIGNS
- Some new results on nonperfect secret sharing schemes
- A.C. Characteristics of the Electroviscous Effect
- Transient Pressure-Drop Fluctuatins in Electroviscous Effect
- Electroviscous Effect in Liquid Crystals
- The Electroviscous Effect in the MBBA Liquid Crystal
- Almost Secure (1-Round, n-Channel) Message Transmission Scheme
- New bound for affine resolvable designs and its application to authentication codes
- On Parallel Hash Functions Based on Block-Ciphers (Symmetric Cipher) (Cryptography and Information Security)
- Square Hash with a Small Key Size (Symmetric Cipher) (Cryptography and Information Security)
- k-Resilient Identity-Based Encryption in the Standard Model(Public Key Cryptography, Cryptography and Information Security)
- On the Universal Hash Functions in Luby-Rackott Cipher (Symmetric Cipher) (Cryptography and Information Security)
- On the Universal Hash Functions in Luby-Rackoff Cipher
- CONSTRUCTIONS OF GROUP DIVISIBLE DESIGNS
- BOUNDS ON THE EFFICIENCY OF THE RESIDUAL DESIGN OF EXTENDED BIB DESIGNS(Optimal Combinatorial Structures on Discrete Mathematical Models)
- Birthday Paradox for Multi-Collisions
- Practical and Proven Zero-Knowledge Constant Round Variants of GQ and Schnorr (Special Section on Cryptography and Information Security)
- Process interactionism, process analysis, and self process : An extension of Kurt Lewin's approach to personality psychology
- Construction of Rectangular Designs(Combinatorial Aspects on the Analysis of Mathematical Models)
- How to Design Efficient Multiple-Use 1-out-n Oblivious Transfer
- Square Hash with a Small Key Size
- Relation between Verifiable Random Functions and Convertible Undeniable Signatures, and New Constructions