Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDesigns, Codes and Cryptography, Volume 49, 2008
Volume 49, Numbers 1-3, December 2008
- Pascale Charpin, Tor Helleseth:
Editorial: In memory of Hans Dobbertin. 1-2 - Hans Dobbertin, Gregor Leander
:
Bent functions embedded into the recursive framework of ℤ-bent functions. 3-22 - J. F. Dillon:
More DD difference sets. 23-32 - Harald Niederreiter, Ayineedi Venkateswarlu:
Periodic multisequences with large error linear complexity. 33-45 - Igor A. Semaev:
On solving sparse algebraic equations over finite fields. 47-60 - Ferruh Özbudak, Zülfükar Saygi:
Systematic authentication codes using additive polynomials. 61-77 - Kathy J. Horadam, David G. Farmer:
Bundles, presemifields and nonlinear functions. 79-94 - Sumanta Sarkar, Subhamoy Maitra:
Idempotents in the neighbourhood of Patterson-Wiedemann functions having Walsh spectra zeros. 95-103 - Ernst M. Gabidulin, Nina I. Pilipchuk:
Error and erasure correcting algorithms for rank codes. 105-122 - Goutam Paul, Siddheshwar Rathi, Subhamoy Maitra:
On non-negligible bias of the first output byte of RC4 towards the first three bytes of the secret key. 123-134 - Jon-Lark Kim, Patrick Solé:
Skew Hadamard designs and their codes. 135-145 - Håvard Raddum, Igor A. Semaev:
Solving Multiple Right Hand Sides linear equations. 147-160 - Lars Eirik Danielsen, Matthew Geoffrey Parker:
Edge local complementation and equivalence of binary linear codes. 161-170 - Reza Rezaeian Farashahi, Ruud Pellikaan, Andrey Sidorenko:
Extractors for binary elliptic curves. 171-186 - Jan De Beule, Klaus Metsch, Leo Storme:
Characterization results on arbitrary non-weighted minihypers and on linear codes meeting the Griesmer bound. 187-197 - Maria Christopoulou, Theodoulos Garefalakis, Daniel Panario, David Thomson:
The trace of an optimal normal element and low complexity normal bases. 199-215 - Mariusz Czapski, Maciej Nikodem:
Error detection and error correction procedures for the advanced encryption standard. 217-232 - Haifeng Qian, Yuan Zhou, Zhibin Li, Zecheng Wang, Bing Zhang:
Efficient public key encryption with smallest ciphertext expansion from factoring. 233-249 - George Petrides, Johannes Mykkeltveit:
Composition of recursions and nonlinear complexity of periodic binary sequences. 251-264 - Danyo Danev, Stefan M. Dodunekov:
A family of ternary quasi-perfect BCH codes. 265-271 - Marcus Brinkmann, Gregor Leander:
On the classification of APN functions up to dimension five. 273-288 - Ryo Nojima, Hideki Imai, Kazukuni Kobara, Kirill Morozov:
Semantic security for the McEliece cryptosystem without random oracles. 289-305 - Rogério M. Siqueira, Sueli I. Rodrigues Costa:
Flat tori, lattices and bounds for commutative group codes. 307-321 - Rafaël Fourquet, Cédric Tavernier:
An improved list decoding algorithm for the second order Reed-Muller codes and its applications. 323-340 - Christian Bey, Gohar M. Kyureghyan:
On Boolean functions with the sum of every two of them being bent. 341-346 - Kseniya Garaschuk, Petr Lisonek:
On binary Kloosterman sums divisible by 3. 347-357
a service of 
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 2024-05-10 19:47 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 and maintained by:
the dblp computer science bibliography is funded and supported by:
