8. IMA 2001:
Cirencester, UK
Bahram Honary (Ed.):
Cryptography and Coding, 8th IMA International Conference, Cirencester, UK, December 17-19, 2001, Proceedings.
Lecture Notes in Computer Science 2260 Springer 2001, ISBN 3-540-43026-1
- A. Kh. Al Jabri:
A Statistical Decoding Algorithm for General Linear Block Codes.
1-8

- Christoph Lange, Andreas Ahrens:
On the Undetected Error Probability for Shortened Hamming Codes on Channels with Memory.
9-19

- Irfan Siap:
The Complete Weight Enumerator for Codes over Mn×s(Fq).
20-26

- Maki Yoshida, Toru Fujiwara:
Further Improvement of Kumar-Rajagopalan-Sahai Coding Constructions for Blacklisting Problem.
27-37

- Simon Hirst, Bahram Honary:
A Simple Soft-Input/Soft-Output Decoder for Hamming Codes.
38-43

- Manfred von Willich:
A Technique with an Information-Theoretic Basis for Protecting Secret Data from Differential Power Attacks.
44-62

- Karl Brincat, Chris J. Mitchell:
Key Recovery Attacks on MACs Based on Properties of Cryptographic APIs.
63-72

- Nigel P. Smart:
The Exact Security of ECIES in the Generic Group Model.
73-84

- Eric Filiol, Caroline Fontaine:
A New Ultrafast Stream Cipher Design: COS Ciphers.
85-98

- Marc Joye, Jean-Jacques Quisquater:
On Rabin-Type Signatures.
99-113

- Seungjoo Kim, Jung Hee Cheon, Marc Joye, Seongan Lim, Masahiro Mambo, Dongho Won, Yuliang Zheng:
Strong Adaptive Chosen-Ciphertext Attacks with Memory Dump (or: The Importance of the Order of Decryption and Validation).
114-127

- F. Javier Galán-Simón, Edgar Martínez-Moro, Juan Tena Ayuso:
Majority-Logic-Decodable Cyclic Arithmetic-Modular AN-Codes in 1, 2, and L Steps.
128-137

- David J. C. MacKay:
Almost-Certainly Runlength-Limiting Codes.
138-147

- Jort van Mourik, David Saad, Yoshiyuki Kabashima:
Weight vs. Magnetization Enumerator for Gallager Codes.
148-157

- J. T. Paire, Paul Coulton, Patrick G. Farrell:
Graph Configurations and Decoding Performance.
158-165

- Philip Benachour, Patrick G. Farrell, Bahram Honary:
A Line Code Construction for the Adder Channel with Rates Higher than Time-Sharing.
166-175

- Ahmed Al-Dabbagh, Michael Darnell:
The Synthesis of TD-Sequences and Their Application to Multi-functional Communication Systems.
176-190

- Svetla Nikova, Ventzislav Nikov:
Improvement of the Delsarte Bound for tau-Designs in Finite Polynomial Metric Spaces.
191-204

- Shujun Li, Li Qi, Li Wenmin, Xuanqin Mou, Cai Yuanlong:
Statistical Properties of Digital Piecewise Linear Chaotic Maps and Their Roles in Cryptography and Pseudo-Random Coding.
205-221

- Joan Daemen, Vincent Rijmen:
The Wide Trail Design Strategy.
222-238

- Niklas Borselius, Chris J. Mitchell, Aaron Wilson:
Undetachable Threshold Signatures.
239-244

- Werner Schindler, François Koeune, Jean-Jacques Quisquater:
Improving Divide and Conquer Attacks against Cryptosystems by Better Error Detection / Correction Strategies.
245-267

- Konstantinos Rantos, Chris J. Mitchell:
Key Recovery Scheme Interoperability - A Protocol for Mechanism Negotiation.
268-276

- Cyril Prissette:
Unconditionally Secure Key Agreement Protocol.
277-293

- N. Komninos, Bahram Honary, Michael Darnell:
An Efficient Stream Cipher Alpha1 for Mobile and Wireless Devices.
294-300

- Viktoriya Masol:
Investigation of Linear Codes Possessing Some Extra Properties.
301-306

- David Saad, Yoshiyuki Kabashima, Tatsuto Murayama, Renato Vicente:
Statistical Physics of Low Density Parity Check Error Correcting Codes.
307-316

- Kenneth J. Giuliani, Guang Gong:
Generating Large Instances of the Gong-Harn Cryptosystem.
317-328

- Paul A. Crouch, James H. Davenport:
Lattice Attacks on RSA-Encrypted IP and TCP.
329-338

- Matthew G. Parker:
Spectrally Bounded Sequences, Codes, and States: Graph Constructions and Entanglement.
339-354

- Willi Geiselmann, Rainer Steinwandt, Thomas Beth:
Attacking the Affine Parts of SFLASH.
355-359

- Clifford Cocks:
An Identity Based Encryption Scheme Based on Quadratic Residues.
360-363

- Lejla Batina, Geeke Muurling:
Another Way of Doing RSA Cryptography in Hardware.
364-373

- Julio César Hernández Castro, José María Sierra, Arturo Ribagorda, Benjamín Ramos, J. Carlos Mex-Perera:
Distinguishing TEA from a Random Permutation: Reduced Round Versions of TEA Do Not Have the SAC or Do Not Generate Random Numbers.
374-377

- Seyed J. Tabatabaian, Sam Ikeshiro, Murat Gumussoy, Mungal S. Dhanda:
A New Search Pattern in Multiple Residue Method (MRM) and Its Importance in the Cryptanalysis of the RSA.
378-386

- Lee Jongkook, Ryu Shiryong, Kim Jeungseop, Yoo Keeyoung:
A New Undeniable Signature Scheme Using Smart Cards.
387-394

- Alexandr Y. Lev, Yuliy A. Lev, Vyacheslav N. Okhrymenko:
Non-binary Block Inseparable Errors Control Codes.
395-401

- Sabine Leveiller, Joseph Boutros, Philippe Guillot, Gilles Zémor:
Cryptanalysis of Nonlinear Filter Generators with {0, 1}-Metric Viterbi Decoding.
402-414

Last update Tue May 21 17:16:33 2013
CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page