default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID9th IMA 2003: Cirencester, UK
- Kenneth G. Paterson:
Cryptography and Coding, 9th IMA International Conference, Cirencester, UK, December 16-18, 2003, Proceedings. Lecture Notes in Computer Science 2898, Springer 2003, ISBN 3-540-20663-9 - Patrick Guy Farrell:
Recent Developments in Array Error-Control Codes: (Invited Paper). 1-3 - Eirik Rosnes, Øyvind Ytrehus:
High Rate Convolutional Codes with Optimal Cycle Weights. 4-23 - Lina Fagoonee, Bahram Honary:
A Multifunctional Turbo-Based Receiver Using Partial Unit Memory Codes. 24-34 - Andreas J. Winter
, Anderson C. A. Nascimento, Hideki Imai:
Commitment Capacity of Discrete Memoryless Channels. 35-51 - Hans Georg Schaathun, Tor Helleseth:
Separating and Intersecting Properties of BCH and Kasami Codes. 52-65 - Thomas Johansson:
Analysis and Design of Modern Stream Ciphers: (Invited Paper) p. 66 - Håvard Molland, John Erik Mathiassen, Tor Helleseth:
Improved Fast Correlation Attack Using Low Rate Codes. 67-81 - Yuri L. Borissov, An Braeken, Svetla Nikova, Bart Preneel:
On the Covering Radius of Second Order Binary Reed-Muller Code in the Set of Resilient Boolean Functions. 82-92 - Enes Pasalic:
Degree Optimized Resilient Boolean Functions from Maiorana-McFarland Class. 93-114 - Kathy J. Horadam:
Differential Uniformity for Arrays. 115-124 - Richard Walton:
Uses and Abuses of Cryptography (Invited Paper). 125-132 - Alexander W. Dent:
A Designer's Guide to KEMs. 133-151 - Eike Kiltz, John Malone-Lee:
A General Construction of IND-CCA2 Secure Public Key Encryption. 152-166 - Dae Hyun Yum, Pil Joong Lee:
Efficient Key Updating Signature Schemes Based on IBS. 167-182 - Harald Niederreiter, Igor E. Shparlinski:
Periodic Sequences with Maximal Linear Complexity and Almost Maximal k-Error Linear Complexity. 183-189 - Robert Granger:
Estimates for Discrete Logarithm Computations in Finite Fields of Small Characteristic. 190-206 - Andrew J. Holt, James H. Davenport:
Resolving Large Prime(s) Variants for Discrete Logarithm Computation. 207-222 - Katharina Geißler, Nigel P. Smart:
Computing the M = U Ut Integer Matrix Decomposition. 223-233 - George Petrides:
Cryptanalysis of the Public Key Cryptosystem Based on the Word Problem on the Grigorchuk Groups. 234-244 - Werner Schindler, Colin D. Walter:
More Detail for a Combined Timing and Power Attack against Implementations of RSA. 245-263 - Simon R. Blackburn, Domingo Gómez-Pérez, Jaime Gutierrez, Igor E. Shparlinski:
Predicting the Inversive Generator. 264-275 - Werner Schindler:
A Stochastical Model and Its Analysis for a Physical Random Number Generator Presented At CHES 2002. 276-289 - Mitsuhiro Hattori, Shoichi Hirose, Susumu Yoshida:
Analysis of Double Block Length Hash Functions. 290-302 - Valtteri Niemi:
Cryptography in Wireless Standards: (Invited Paper). 303-305 - Tetsu Iwata, Kaoru Kurosawa:
On the Correctness of Security Proofs for the 3GPP Confidentiality and Integrity Algorithms. 306-318 - Geraint Price:
A General Attack Model on Hash-Based Client Puzzles. 319-331 - Sattam S. Al-Riyami, Kenneth G. Paterson:
Tripartite Authenticated Key Agreement Protocols from Pairings. 332-359 - Chris J. Mitchell:
Remote User Authentication Using Public Information. 360-369 - Adam Barnett, Nigel P. Smart:
Mental Poker Revisited. 370-383
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2026-07-14 00:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
