Designs, Codes and Cryptography, Volume 58

Volume 58, Number 1, January 2011

• Xiaoyu Liu:
  An equivalence of Ward's bound and its application. 1-9
  
• Tamir Tassa:
  Generalized oblivious transfer by secret sharing. 11-21
  
• Jie Cui, Junying Pei:
  Quaternary 1-generator quasi-cyclic codes. 23-33
  
• Changan Zhao, Dongqing Xie, Fangguo Zhang, Jingwei Zhang, Bing-Long Chen:
  Computing bilinear pairings on elliptic curves with automorphisms. 35-44
  
• Aaram Yun, Je Hong Park, Jooyoung Lee:
  On Lai-Massey and quasi-Feistel ciphers. 45-72
  
• Padraig Ó Catháin, Marc Röder:
  The cocyclic Hadamard matrices of order less than 40. 73-88
  
• Marco Buratti, Koji Momihara, Anita Pasotti:
  New results on optimal (v, 4, 2, 1) optical orthogonal codes. 89-109
  

Volume 58, Number 2, February 2011

• Rajendra M. Pawale:
  Quasi-symmetric designs with the difference of block intersection numbers two. 111-121
  
• Sudhir R. Ghorpade, Sartaj Ul Hasan, Meena Kumari:
  Primitive polynomials, singer cycles and word-oriented linear feedback shift registers. 123-134
  
• Jianguo Lei, Cuiling Fan:
  Optimal difference systems of sets and partition-type cyclic difference packings. 135-153
  
• David G. Glynn:
  An invariant for matrices and sets of points in prime characteristic. 155-172
  
• Roberto Maria Avanzi, Clemens Heuberger, Helmut Prodinger:
  Redundant τ-adic expansions I: non-adjacent digit sets and their applications to scalar multiplication. 173-202
  
• Koichi Betsumiya, Masaaki Harada, Hiroshi Kimura:
  Hadamard matrices of order 32 and extremal ternary self-dual codes. 203-214
  
• David G. Glynn:
  A condition for arcs and MDS codes. 215-218
  
• Dimitrios Poulakis:
  Erratum to: A variant of Digital Signature Algorithm. 219
  

Volume 58, Number 3, March 2011

• Bahattin Yildiz, Suat Karadeniz:
  Cyclic codes over F₂+uF₂+vF₂+uvF₂. 221-234
  
• Jong Hwan Park:
  Inner-product encryption under standard assumptions. 235-257
  
• Yongqiang Li, Mingsheng Wang:
  On EA-equivalence of certain permutations to power mappings. 259-269
  
• Palash Sarkar:
  A trade-off between collision probability and key size in universal hashing using polynomials. 271-278
  
• Jianqin Zhou:
  On the k-error linear complexity of sequences with period 2pⁿ over GF(q). 279-296
  
• Kwangsu Lee, Dong Hoon Lee:
  Improved hidden vector encryption with short ciphertexts and tokens. 297-319
  
• Hui Zhang, Gennian Ge:
  Completely reducible super-simple designs with block size four and related super-simple packings. 321-346
  

Last update Thu May 23 18:40:43 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page