- Realization of Decimation-Hadamard Transform for Binary Generalized GMW Sequences.
Nam Yul Yun and Guang Gong.
- Interpolation of Functions Related to the Integer Factoring Problem.
Clemens Adelmaan and Arne Winterhof.
- Inverses of Multivariate Polynomial Matrices using Discrete Convolution.
R. Lobo and D. Bitzer and M. Vouk.
- The Asymptotic Behavior of 2-Adic Complexity.
Andrew Klapper
- ID-Based Series-Parallel Multisignature Schemes for Multi-messages from Bilinear Maps.
Lihua Wang and Eiji Okamoto and Ying Miao and Takeshi Okamoto.
- New results on 2-weight projective cyclic codes.
Jacques Wolfmann.
- An Improved Algorithm for uP+vQ on a Family of Elliptic Curves.
Zue Wuefei and Kuang Baijie and Zang YaJuan.
- on Wagner-Magyarik cryptosystem.
Françoise Levy-dit-Vehel and Ludovic Perret .
- Second Generalized Hamming Weights for Extremal Self-Dual Codes.
Keisuke Shiromoto .
- Extending Gibson's attacks on the GPT cryptosystem.
R. Overbeck.
- On Degrees of Polynomial Interpolations Related to Elliptic Curve Cryptography.
Takakazu Satoh.
- Interpolation of the discrete logarithm in a finite field of characteristic two by Boolean functions.
Nina BrandStätter and Tanja Lange and Arne Winterhof.
- Tanner Graph Structure and Iterative Decoding.
Christine Kelley and Deepak Sridhara.
- 3-Designs from Z4-Goethals-like Codes and Variants of Cyclotomic Polynomials.
Jyrki Lahtonen and Kalle Ranto and Roope Vehkalahti .
- Codes Based on Similarities Between DNA Sequences.
A. D'Yachkov and A. Macula and P. Vilenkin and I. Ismalgilov.
- A Chosen Ciphertext Attack on a Public Key Cryptosystem Based on Lyndon Words.
Ludovic Perret .
- Geometric conditions for the extendability of ternary linear codes.
Tatsuya Maruta and Kei Okamotot.
- Classes of Plateaued Rotation Symmetric Boolean Functions under Transformation of Walsh Spectra.
Alexander Maximov.
- Efficient Convergent Decoding on Tail-Biting Trellises.
Priti Shankar.
- On codes correcting symmetric rank errors.
Nina I. Pilipchuk and Ernst M. Gabidulin.
- Universal representation of Z_4-linear and other Preparata codes.
N. N. Tokareva.
- Construction of perfect q-ary codes by switchings of simple components.
A. V. Los.
- Monomial Bent Functions.
Nils Gregor Leander
- A Novel Method for Constructing Almost Perfect Polyphase Sequences.
Xiangyong Zeng and Lei Hu and Quingchong Liu
- Quaternary Convolutional Codes From Block Codes Over Galois Rings.
Patrick Solé and Virgilio Sison.
- Group Actions based Perfect Nonlinearity.
Laurent Poinsot and Sami Harari.
- Constructions of Complementary Sequences for Power-Controlled OFDM Transmission.
Kai-Uwe Schmidt and Adolf Finger.
- Negacyclic Duadic Codes.
Thomas Blackford.
- Threshold Secret Sharing Schemes for XOR-based Visual Cryptography.
P. Tuyls and H. D. L. Hollmann and J. H. van Lint and L. Tolhuizen.
- Some constructions of transitive codes.
F.I. Solov'eva .
- New Constructions of Almost Bent and Almost Perfect Nonlinear Polynomials.
Lilya Budaghyan Claude Carlet and Alexander Pott.
- Multi-Dimensional Hash Chains and Application to Micropayment Schemes.
Quan Son Nguyen.
- Reconstruction of Kronecker Sequences.
Quanlong Wang and Quingchong Liu and Lei Hu.
- Frequency/Time Hopping Sequences with Large Linear Complexities.
Yung Pyo Hong and Hong Yeop Song.
- Shorter keys for code based cryptography.
Philippe Gaborit.
- Improved Bounds On Weil Sums Over Galois Rings and Homogeneous Weights.
San Ling and Ferruh Özbudak.
- A Welch-Berlekamp like algorithm for decoding Gabidulin codes.
Pierre Loidreau.
- On a Relation Between Verifiable Secret Sharing Schemes and a Class of Error-Correcting Codes.
Ventzislav Nikov and Svetla Nikova.
- Reduction of conjugacy problem in braid groups, using theirs double Garside's structure.
Samuel Maffre.
- Binary projective [120,8;56,64] codes having an automorphism of order 3 and SDP designs.
Iliya Bouyukliev and Stefka Bouyuklieva and Stefan Dodunekov.
- On semisimple algebra codes
E. Gartínez-Moro
- Finding good differential patterns for attacks on SHA-1.
Krystian Matusiewicz and Josef Pieprzyk.
- A new public-key cryptosystem based on the problem of reconstruction of p-polynomials.
Cédric Faure and Pierre Loidreau.
- Differentially Affine Maps.
Gohar M. Kyureghyan .
- Information-Theoretically Secure Anonymous Group Authentication with an Arbiter.
Kazuyuki Kinose and Takenobu Seito and Junji Shikata.
- On affine rank of spectrum support for plateaued function.
Yuriy Tarannikov .
- Bent Functions with $2^r$ Niho Exponents.
Nils Gregor Leander.
- An ID-based Non-Interactive Tripartite Key Agreement Protocol with k-Resilience.
Raylin Tso and Takeshi Okamoto and Tsuyoshi Takagi and Eiji Okamoto.
- Linear Filtering of Nonlinear Shift Register Sequences.
Berndt M. Gammel and Rainer Göttfert
- On the Non-Existence of Crooked Functions on Finite Fields.
Eimar Byrne and Gary Mcguire.
- Rate-Diversity Optimal Space-Time Code Constructions Based on the Generalized Binary Rank Criterion.
A. Roger Hammons Jr.
- RSA-Based Secret Handshakes.
Damien Vergnaud.
- Error and Erasure Correction of Interleaved Reed--Solomon Codes.
Georg Schmidt and Vladimir R. Sidorenko and Martin Bossert.
- On the Affine Parts of HFE-Cryptosystems and Systems with Branches.
Patrick Felke .
- On the weights of irreducible cyclic codes.
Yves Aubry and Philippe Langevin.
- Spectral Interpretations of the Interlace polynomial.
Constanza Riera and Matthew G. Parker.
- A New Key Assignment Scheme for Access Control in a Complete Tree Hierarchy.
Alfredo De Santis and Anna Lisa Ferrara and Barbara Masucci.
- Dimension of the linearization equations of the Matsumoto-Imai cryptosystems.
A. Diene and J. Ding and J. Gower and T.J. Hodges and Z. Yin .
- On reconstruction of functions on the hypercube.
Anastasia Yu Vasil'eva.
- $Z_{2^k}$-duality, $Z_{2^k}$-linear Hadamard codes, and co-$Z_{2^k}$-linear extended perfect codes.
Denis S. Krotov.
- New Constructions of Codes for DNA Computing.
Olgiva Milencovic and Navin Kashyap.
- Sperner's theorem and unidirectional codes.
Bella Bose and Torlev Klřve
Last update June, 06 2006.