Information and Computation, Volume 151

Volume 151, Numbers 1-2, May/June 1999

• Leonard M. Adleman, Ming-Deh A. Huang:
  Function Field Sieve Method for Discrete Logarithms over Finite Fields. 5-16
  
• Jin-yi Cai, Thomas W. Cusick:
  A Lattice-Based Public-Key Cryptosystem. 17-31
  
• Claude Carlet:
  On Cryptographic Propagation Criteria for Boolean Functions. 32-56
  
• Hans Dobbertin:
  Almost Perfect Nonlinear Power Functions on GF(2n): The Niho Case. 57-72
  
• Tor Helleseth, H. M. Martinsen:
  Binary Sequences of Period 2m-1 with Large Linear Complexity. 73-91
  
• Ming-Deh A. Huang, Chaoping Xing:
  Some Computational Problems of Cryptographic Significance Concerning Elliptic Curves over Rings. 92-99
  
• Thomas Johansson:
  Further Results on Asymmetric Authentication Schemes. 100-133
  
• Takayasu Kaida, Satoshi Uehara, Kyoki Imamura:
  An Algorithm for thek-Error Linear Complexity of Sequences over GF(p^m) with Period pⁿ, pa Prime. 134-147
  
• Reihaneh Safavi-Naini, Huaxiong Wang:
  Multireceiver Authentication Codes: Models, Bounds, Constructions, and Extensions. 148-172
  

Last update Fri May 24 16:45:39 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page