Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDesigns, Codes and Cryptography, Volume 82
Volume 82, Numbers 1-2, January 2017
- Pascale Charpin, Thomas Johansson
, Gohar M. Kyureghyan, Nicolas Sendrier, Jean-Pierre Tillich:
Editorial: Special issue on coding and cryptography. 1-2 - Christina Boura, Anne Canteaut, Lars R. Knudsen, Gregor Leander:
Reflection ciphers. 3-25 - Sondre Rønjom:
Improving algebraic attacks on stream ciphers based on linear feedback shift register over $$\mathbb {F}_{2^k}$$ F 2 k. 27-41 - Pavol Zajac:
Upper bounds on the complexity of algebraic cryptanalysis of ciphers with a low multiplicative complexity. 43-56 - Serhii Dyshko:
MacWilliams Extension Theorem for MDS codes over a vector space alphabet. 57-67 - Sergey Bezzateev, Natalia A. Shekhunova:
Lower bound of covering radius of binary irreducible Goppa codes. 69-76 - Kishan Chand Gupta, Sumit Kumar Pandey, Ayineedi Venkateswarlu:
On the direct construction of recursive MDS matrices. 77-94 - Kaushik Chakraborty, Sumanta Sarkar, Subhamoy Maitra, Bodhisatwa Mazumdar, Debdeep Mukhopadhyay, Emmanuel Prouff:
Redefining the transparency order. 95-115 - Marine Minier:
Improving impossible-differential attacks against Rijndael-160 and Rijndael-224. 117-129 - Santanu Sarkar, Ayineedi Venkateswarlu:
Revisiting (nested) Roos bias in RC4 key scheduling algorithm. 131-148 - Srimanta Bhattacharya, Sumanta Sarkar:
On some permutation binomials and trinomials over $$\mathbb {F}_{2^n}$$ F 2 n. 149-160 - Mehdi Tibouchi, Taechan Kim:
Improved elliptic curve hashing and point representation. 161-177 - Kishan Chand Gupta, Sumit Kumar Pandey, Ayineedi Venkateswarlu:
Towards a general construction of recursive MDS diffusion layers. 179-195 - Arkadii G. D'yachkov, Ilya Vorobyev, N. A. Polyanskii, Vladislav Yu. Shchukin:
Cover-free codes and separating system codes. 197-209 - Arkadii G. D'yachkov, Ilya Vorobyev, N. A. Polyanskii, Vladislav Yu. Shchukin:
Symmetric disjunctive list-decoding codes. 211-229 - Arkadii G. D'yachkov, Ilya Vorobyev, Nikita Polyanskii, Vladislav Yu. Shchukin:
Almost cover-free codes and designs. 231-247 - Cem Güneri, Ferruh Özbudak, Funda Özdemir:
Hasse-Weil bound for additive cyclic codes. 249-263 - Nurdagül Anbar, Wilfried Meidl, Alev Topuzoglu:
Idempotent and p-potent quadratic functions: distribution of nonlinearity and co-dimension. 265-291 - Vladimir Gritsenko, Grigory Kabatiansky, Vladimir S. Lebedev, Alexey Maevskiy:
Signature codes for noisy multiple access adder channel. 293-299 - Jeremy Maitin-Shepard:
Optimal software-implemented Itoh-Tsujii inversion for $$\mathbb {F}_{2^{m}}$$ F 2 m. 301-318 - Céline Blondeau, Kaisa Nyberg:
Joint data and key distribution of simple, multiple, and multidimensional linear cryptanalysis test statistic and its impact to data complexity. 319-349 - Santanu Sarkar, Subhamoy Maitra, Anubhab Baksi:
Observing biases in the state: case studies with Trivium and Trivia-SC. 351-375 - Brandon Dravie, Philippe Guillot, Gilles Millérioux:
Security proof of the canonical form of self-synchronizing stream ciphers. 377-388 - Sven Puchinger, Johan Sebastian Rosenkilde, Wenhui Li, Vladimir Sidorenko:
Row reduction applied to decoding of rank-metric and subspace codes. 389-409 - Peter G. Boyvalenkov, Peter D. Dragnev, Douglas P. Hardin, Edward B. Saff, Maya Stoyanova:
Energy bounds for codes and designs in Hamming spaces. 411-433 - Valentin Suder:
Antiderivative functions over $$\mathbb {F}_{2^n}$$ F 2 n. 435-447 - Hannes Bartz, Vladimir Sidorenko:
Algebraic decoding of folded Gabidulin codes. 449-467 - Quentin Alamélou, Olivier Blazy, Stéphane Cauchie, Philippe Gaborit:
A code-based group signature scheme. 469-493 - Anthony Journault, François-Xavier Standaert, Kerem Varici:
Improving the security and efficiency of block ciphers based on LS-designs. 495-509
Volume 82, Number 3, March 2017
- Jerod Michel, Baokun Ding:
A generalization of combinatorial designs and related codes. 511-529 - Yupeng Jiang, Dongdai Lin:
On affine sub-families of Grain-like structures. 531-542 - Yun Fan, Bangteng Xu:
Fourier transforms and bent functions on faithful actions of finite abelian groups. 543-558 - Kaoru Kurosawa, Hiroyuki Ohta, Kenji Kakuta:
How to make a linear network code (strongly) secure. 559-582 - Shuxing Li, Hengjia Wei, Gennian Ge:
Generic constructions for partitioned difference families with applications: a unified combinatorial approach. 583-599 - Palash Sarkar, Shashank Singh:
A new method for decomposition in the Jacobian of small genus hyperelliptic curves. 601-616 - Moises Delgado, Heeralal Janwa:
On the conjecture on APN functions and absolute irreducibility of polynomials. 617-627 - R. Lakshmanan, S. Arumugam:
Construction of a (k, n)-visual cryptography scheme. 629-645 - Haiying Liu, Keqin Feng, Rongquan Feng:
Nonexistence of generalized bent functions from ℤ2n to ℤm. 647-662 - Shudi Yang, Zheng-an Yao:
Complete weight enumerators of a family of three-weight linear codes. 663-674 - Melissa A. Huggan, Gary L. Mullen, Brett Stevens, David Thomson:
Sudoku-like arrays, codes and orthogonality. 675-693 - Ming Li, Yupeng Jiang, Dongdai Lin:
The adjacency graphs of some feedback shift registers. 695-713
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-06-18 21:18 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:
