Conferences in DBLP

IMA Conference on Cryptography and Coding (ima)
2009 (conf/ima/2009)

1. 
   Subspace Codes. [Citation Graph (, )][DBLP]
   
   
2. 
   On Linear Programming Decoding on a Quantized Additive White Gaussian Noise Channel. [Citation Graph (, )][DBLP]
   
   
3. 
   Codes as Modules over Skew Polynomial Rings. [Citation Graph (, )][DBLP]
   
   
4. 
   On Higher Weights and Code Existence. [Citation Graph (, )][DBLP]
   
   
5. 
   Mass Formula for Even Codes over. [Citation Graph (, )][DBLP]
   
   
6. 
   On the Classification of Self-dual -Codes. [Citation Graph (, )][DBLP]
   
   
7. 
   On Linear Codes from Maximal Curves. [Citation Graph (, )][DBLP]
   
   
8. 
   On Linear Cryptanalysis with Many Linear Approximations. [Citation Graph (, )][DBLP]
   
   
9. 
   Bivium as a Mixed-Integer Linear Programming Problem. [Citation Graph (, )][DBLP]
   
   
10. 
    Security of Cyclic Double Block Length Hash Functions. [Citation Graph (, )][DBLP]
    
    
11. 
    Another Glance at Double-Length Hashing. [Citation Graph (, )][DBLP]
    
    
12. 
    Geometric Ideas for Cryptographic Equation Solving in Even Characteristic. [Citation Graph (, )][DBLP]
    
    
13. 
    Provably Secure Code-Based Threshold Ring Signatures. [Citation Graph (, )][DBLP]
    
    
14. 
    A New Protocol for the Nearby Friend Problem. [Citation Graph (, )][DBLP]
    
    
15. 
    Distributing the Key Distribution Centre in Sakai-Kasahara Based Systems. [Citation Graph (, )][DBLP]
    
    
16. 
    Key Predistribution Schemes and One-Time Broadcast Encryption Schemes from Algebraic Geometry Codes. [Citation Graph (, )][DBLP]
    
    
17. 
    Attribute-Based Encryption Supporting Direct/Indirect Revocation Modes. [Citation Graph (, )][DBLP]
    
    
18. 
    Certificate-Free Attribute Authentication. [Citation Graph (, )][DBLP]
    
    
19. 
    Comparing with RSA. [Citation Graph (, )][DBLP]
    
    
20. 
    Double-Exponentiation in Factor-4 Groups and Its Applications. [Citation Graph (, )][DBLP]
    
    
21. 
    Oracle-Assisted Static Diffie-Hellman Is Easier Than Discrete Logarithms. [Citation Graph (, )][DBLP]
    
    
22. 
    An Improvement to the Gaudry-Schost Algorithm for Multidimensional Discrete Logarithm Problems. [Citation Graph (, )][DBLP]
    
    
23. 
    On Designs and Multiplier Groups Constructed from Almost Perfect Nonlinear Functions. [Citation Graph (, )][DBLP]
    
    
24. 
    A New Family of Hyper-Bent Boolean Functions in Polynomial Form. [Citation Graph (, )][DBLP]
    
    
25. 
    The Rayleigh Quotient of Bent Functions. [Citation Graph (, )][DBLP]
    
    
26. 
    Cache Timing Analysis of LFSR-Based Stream Ciphers. [Citation Graph (, )][DBLP]
    
    
27. 
    Optimal Recovery of Secret Keys from Weak Side Channel Traces. [Citation Graph (, )][DBLP]
    
    
28. 
    Practical Zero-Knowledge Proofs for Circuit Evaluation. [Citation Graph (, )][DBLP]