default search action
Designs, Codes and Cryptography, Volume 87
Volume 87, Number 1, January 2019
- Xinxin Fan, Guang Gong, Berry Schoenmakers, Francesco Sica
, Andrey Sidorenko:
Secure simultaneous bit extraction from Koblitz curves. 1-13 - Haibo Liu
Several classes of linear codes with a few weights from defining sets over $$\mathbb {F}_p+u\mathbb {F}_p$$ F p + u F p. 15-29 - Shihui Fu, Xiutao Feng
Involutory differentially 4-uniform permutations from known constructions. 31-56 - John T. Ethier, Gary L. Mullen:
Sets of mutually orthogonal Sudoku frequency squares. 57-65 - Ronan Egan
Phased unitary Golay pairs, Butson Hadamard matrices and a conjecture of Ito's. 67-74 - Thierry Mefenza, Damien Vergnaud
Polynomial interpolation of the generalized Diffie-Hellman and Naor-Reingold functions. 75-85 - Minjia Shi
How many weights can a linear code have? 87-95 - Minquan Cheng
Improved bounds on 2-frameproof codes with length 4. 97-106 - Tao Zhang
Constructions of optimal Ferrers diagram rank metric codes. 107-121 - Azam Soleimanian
Publicly verifiable searchable symmetric encryption based on efficient cryptographic components. 123-147 - Shiyong Zhang
New results on the state cycles of Trivium. 149-162 - Zhixiong Chen
On the q-bentness of Boolean functions. 163-171 - Alp Bassa
Self-dual codes better than the Gilbert-Varshamov bound. 173-182
Volume 87, Numbers 2-3, March 2019
- Faina I. Solov'eva, Daniel Augot, Thomas Johansson, Marine Minier, Victor A. Zinoviev:
Editorial: Special issue on coding and cryptography. 183-184 - Christina Boura
Two notions of differential equivalence on Sboxes. 185-202 - Claude Carlet
On APN exponents, characterizations of differentially uniform functions by the Walsh transform, and related cyclic-difference-set-like structures. 203-224 - Roberto Civino
Differential attacks: using alternative operations. 225-247 - Victor Cauchois, Pierre Loidreau
On circulant involutory MDS matrices. 249-260 - Selçuk Kavut, Subhamoy Maitra, Deng Tang
Construction and search of balanced Boolean functions on even number of variables towards excellent autocorrelation profile. 261-276 - Andreas Lenz
Duplication-correcting codes. 277-298 - Peter G. Boyvalenkov
On spherical codes with inner products in a prescribed interval. 299-315 - Selçuk Kavut, Seher Tutdere
The covering radii of a class of binary cyclic codes and some BCH codes. 317-325 - Jerry Anderson Pinheiro, Roberto Assis Machado, Marcelo Firer
Combinatorial metrics: MacWilliams-type identities, isometries and extension property. 327-340 - Patric R. J. Östergård:
The sextuply shortened binary Golay code is optimal. 341-347 - Sabyasachi Dey
Some results on Fruit. 349-364 - Tsonka Baicheva
Classification of optimal (v, k, 1) binary cyclically permutable constant weight codes with $$k=5, $$ k = 5 , 6 and 7 and small lengths. 365-374 - Daniel Heinlein
Classifying optimal binary subspace codes of length 8, constant dimension 4 and minimum distance 6. 375-391 - Claudio M. Qureshi, Daniel Panario
The graph structure of Chebyshev polynomials over finite fields and applications. 393-416 - Cristina Fernández-Córdoba
On $$\mathbb {Z}_{2^s}$$ Z 2 s -linear Hadamard codes: kernel and partial classification. 417-435 - Daniel Panario
The functional graph of linear maps over finite fields and applications. 437-453 - Elena Egorova
Signature codes for weighted noisy adder channel, multimedia fingerprinting and compressed sensing. 455-462 - Sihem Mesnager, Ferruh Özbudak
Linear codes from weakly regular plateaued functions and their secret sharing schemes. 463-480 - Rafael G. L. D'Oliveira, Marcelo Firer
A distance between channels: the average error of mismatched channels. 481-493 - Svetlana Topalova
Types of spreads and duality of the parallelisms of PG(3, 5) with automorphisms of order 13. 495-507 - Anastasia Vasil'eva
Local distributions for eigenfunctions and perfect colorings of q-ary Hamming graph. 509-516 - Stéphane Ballet
Dense families of modular curves, prime numbers and uniform symmetric tensor rank of multiplication in certain finite fields. 517-525 - Sebati Ghosh, Palash Sarkar
Evaluating Bernstein-Rabin-Winograd polynomials. 527-546 - Hannes Bartz
Improved syndrome decoding of lifted $$L$$ L -interleaved Gabidulin codes. 547-567 - Sergey Bezzateev
Totally decomposed cumulative Goppa codes with improved estimations. 569-587 - Sven Puchinger
Improved power decoding of interleaved one-point Hermitian codes. 589-607 - Kishan Chand Gupta, Sumit Kumar Pandey, Ayineedi Venkateswarlu
Almost involutory recursive MDS diffusion layers. 609-626 - Hugues Randriam
Gaps between prime numbers and tensor rank of multiplication in finite fields. 627-645 - Lukas Holzbaur
Improved decoding and error floor analysis of staircase codes. 647-664 - Oliver W. Gnilke
Improved user-private information retrieval via finite geometry. 665-677 - S. Alabdullah, J. W. P. Hirschfeld:
A new lower bound for the smallest complete (k, n)-arc in $$\mathrm {PG}(2, q)$$ PG ( 2 , q ). 679-683 - Kévin Carrier, Jean-Pierre Tillich:
Identifying an unknown code by partial Gaussian elimination. 685-713
Volume 87, Number 4, April 2019
- Ilaria Cardinali, Michel Lavrauw
Preface to the special issue on finite geometries. 715-716 - Karen Meagher
An Erdős-Ko-Rado theorem for the group $$\hbox {PSU}(3, q)$$ PSU ( 3 , q ). 717-744 - Marco Buratti
On disjoint (v, k, k-1) difference families. 745-755 - Stefaan De Winter
Non-existence of partial difference sets in Abelian groups of order 8p3. 757-768 - Marco Buratti, Francesca Merola
Fano Kaleidoscopes and their generalizations. 769-784 - Ivan N. Landjev
Conditions for the existence of spreads in projective Hjelmslev spaces. 785-794 - Daniele Bartoli
Linear codes from Denniston maximal arcs. 795-806 - Stefaan De Winter
Maximal arcs and extended cyclic codes. 807-816 - Fernando Piñero
The weight spectrum of certain affine Grassmann codes. 817-830 - Dieter Jungnickel
The classification of Steiner triple systems on 27 points with 3-rank 24. 831-839 - Assia Rousseva
Linear codes close to the Griesmer bound and the related geometric structures. 841-854 - Igor E. Shparlinski
Codes correcting restricted errors. 855-863 - Aart Blokhuis, Leo Storme
Relative blocking sets of unions of Baer subplanes. 865-877 - Jan De Beule
On the cylinder conjecture. 879-893 - Hiroaki Taniguchi
A variation of the dual hyperoval Sc using presemifields. 895-908 - Bart De Bruyn:
Three homogeneous embeddings of DW (2n-1, 2). 909-929 - Anton Betten
Cubic surfaces over small finite fields. 931-953
Volume 87, Number 5, May 2019
- Pascale Charpin, Philippe Langevin:
Obituary of Jacques Wolfmann (1932-2018). 955-956 - Alice M. W. Hui, Muhammad Adib Surani, Sanming Zhou
The vertex-isoperimetric number of the incidence and non-incidence graphs of unitals. 957-970 - Yuqing Zhu
A variant of the Galbraith-Ruprai algorithm for discrete logarithms with improved complexity. 971-986 - Mariusz Meszka
Orthogonal one-factorizations of complete multipartite graphs. 987-993 - Alexander M. Romanov:
On non-full-rank perfect codes over finite fields. 995-1003 - Junji Shikata, Yohei Watanabe
Identity-based encryption with hierarchical key-insulation in the standard model. 1005-1033 - Yanbin Li, Meiqin Wang:
Cryptanalysis of MORUS. 1035-1058 - Shoko Chisaki
A recursive construction for difference systems of sets. 1059-1068 - Giacomo Micheli
Cryptanalysis of the CLR-cryptosystem. 1069-1086 - Ziling Heng
A construction of q-ary linear codes with irreducible cyclic codes. 1087-1108 - Darcy Best, Trent G. Marbach
Covers and partial transversals of Latin squares. 1109-1136 - Zuling Chang, Martianus Frederic Ezerman
On binary de Bruijn sequences from LFSRs with arbitrary characteristic polynomials. 1137-1160 - Huiqin Xie, Li Yang
Using Bernstein-Vazirani algorithm to attack block ciphers. 1161-1182 - Vladimir Edemskiy
The linear complexity of generalized cyclotomic binary sequences of period pn. 1183-1197
Volume 87, Number 6, June 2019
- A. J. van Zanten:
Primitive idempotent tables of cyclic and constacyclic codes. 1199-1225 - Hiroki Koike, István Kovács, Dragan Marusic
Cyclic groups are CI-groups for balanced configurations. 1227-1235 - Tsuyoshi Miezaki, Manabu Oura:
On the cycle index and the weight enumerator. 1237-1242 - Jerod Michel, Qi Wang
Almost difference sets in nonabelian groups. 1243-1251 - Serhii Dyshko:
The extension theorem for Lee and Euclidean weight codes over integer residue rings. 1253-1269 - Wenquan Bi, Xiaoyang Dong
MILP-aided cube-attack-like cryptanalysis on Keccak Keyed modes. 1271-1296 - Chun Guo, Yaobin Shen, Lei Wang, Dawu Gu:
Beyond-birthday secure domain-preserving PRFs from a single permutation. 1297-1322 - Oriol Farràs
Local bounds for the optimal information ratio of secret sharing schemes. 1323-1344 - Zhengan Huang
Simulation-based selective opening security for receivers under chosen-ciphertext attacks. 1345-1371 - David Derler
Key-homomorphic signatures: definitions and applications to multiparty signatures and non-interactive zero-knowledge. 1373-1413 - Yanxun Chang, Hao Zheng, Junling Zhou
Existence of frame-derived H-designs. 1415-1431 - Daniele Bartoli, Matteo Bonini
Minimum weight codewords in dual algebraic-geometric codes from the Giulietti-Korchmáros curve. 1433-1445 - Minjia Shi, Yan Liu, Hugues Randriam, Lin Sok, Patrick Solé:
Trace codes over Z4, and Boolean functions. 1447-1455 - Ferdinand Ihringer, Karen Meagher
Correction to: Miklós-Manickam-Singhi conjectures on partial geometries. 1457
Volume 87, Number 7, July 2019
- Giorgos Kapetanakis
Variations of the Primitive Normal Basis Theorem. 1459-1480 - Shihui Fu, Xiutao Feng, Dongdai Lin, Qiang Wang
A recursive construction of permutation polynomials over Fq2 with odd characteristic related to Rédei functions. 1481-1498 - Tao Feng
Optimal 2-D (n × m , 3 , 2 , 1)-optical orthogonal codes and related equi-difference conflict avoiding codes. 1499-1520 - Tran van Trung:
On existence theorems for simple t-designs. 1521-1540 - Julien Lavauzelle
Lifted projective Reed-Solomon codes. 1541-1575 - Claude Carlet
Constructing infinite families of low differential uniformity (n, m)-functions with m > n / 2. 1577-1599 - Keju Meng, Fuyou Miao
A secure and efficient on-line/off-line group key distribution protocol. 1601-1620 - Benoît Cogliati
Multi-user security bound for filter permutators in the random oracle model. 1621-1638 - John B. Polhill
A new family of partial difference sets in 3-groups. 1639-1646 - Dongdong Jia, Sumei Zhang, Gengsheng Zhang:
Erasure combinatorial batch codes based on nonadaptive group testing. 1647-1656 - Lucas Reis
Factorization of a class of composed polynomials. 1657-1671 - Matthew Fickus
Equiangular tight frames from group divisible designs. 1673-1697 - Sabyasachi Dutta
Maximal contrast color visual secret sharing schemes. 1699-1711
Volume 87, Number 8, August 2019
- Xing Liu
Improved Singleton bound on frequency hopping sequences and optimal constructions. 1713-1733 - Xing Liu
Correction to: Improved Singleton bound on frequency hopping sequences and optimal constructions. 1735-1736 - Léo Ducas, Cécile Pierrot
Polynomial time bounded distance decoding near Minkowski's bound in discrete logarithm lattices. 1737-1748 - Qichun Wang
A trigonometric sum sharp estimate and new bounds on the nonlinearity of some cryptographic Boolean functions. 1749-1763 - Keisuke Shiromoto
Codes with the rank metric and matroids. 1765-1776 - Mahdi Cheraghchi
Nearly optimal robust secret sharing. 1777-1796 - Jian Liu, Sihem Mesnager:
Weightwise perfectly balanced functions with high weightwise nonlinearity profile. 1797-1813 - Xiang-Dong Hou:
Optimal binary constant weight codes and affine linear groups over finite fields. 1815-1838 - Aart Blokhuis, Maarten De Boeck
Cameron-Liebler sets of k-spaces in $${{\mathrm{PG}}}(n, q)$$ PG ( n , q ). 1839-1856 - Minjia Shi
Additive perfect codes in Doob graphs. 1857-1869 - Torger Olson, Eric Swartz
Transitive PSL(2, 11)-invariant k-arcs in PG(4, q). 1871-1879 - Andries E. Brouwer, Sven C. Polak
Uniqueness of codes using semidefinite programming. 1881-1895 - Itai Dinur:
An algorithmic framework for the generalized birthday problem. 1897-1926 - Yansheng Wu
At most three-weight binary linear codes from generalized Moisio's exponential sums. 1927-1943
Volume 87, Number 9, September 2019
- Jerod Michel, Qi Wang
Almost designs and their links with balanced incomplete block designs. 1945-1960 - Ching-Yi Lai
Quantum encryption and generalized Shannon impossibility. 1961-1972 - Hiroaki Taniguchi
On some quadratic APN functions. 1973-1983 - Antonio Cossidente, Francesco Pavese
On line covers of finite projective and polar spaces. 1985-2002 - Miao Liang
On (t, L)-fold perfect authentication and secrecy codes with arbitration. 2003-2026 - Cícero Carvalho
Projective Reed-Muller type codes on higher dimensional scrolls. 2027-2042 - Qichun Wang
Transparency order for Boolean functions: analysis and construction. 2043-2059 - Yanwei Zhou
Continuous leakage-resilient identity-based encryption with leakage amplification. 2061-2090 - Minjia Shi, Denis S. Krotov
A new distance-regular graph of diameter 3 on 1024 vertices. 2091-2101 - Minjia Shi, Denis S. Krotov
Correction to: A new distance-regular graph of diameter 3 on 1024 vertices. 2103 - Sergey Bereg
New lower bounds for permutation arrays using contraction. 2105-2128 - Peter Vandendriessche
On KM-arcs in non-Desarguesian projective planes. 2129-2137 - Gregory Maxwell, Andrew Poelstra, Yannick Seurin
Simple Schnorr multi-signatures with applications to Bitcoin. 2139-2164 - Xueying Shi, Qin Yue, Yansheng Wu
The dual-containing primitive BCH codes with the maximum designed distance and their applications to quantum codes. 2165-2183
Volume 87, Number 10, October 2019
- Xin Wang
Linear (2, p, p)-AONTs exist for all primes p. 2185-2197 - Nuh Aydin
On equivalence of cyclic codes, generalization of a quasi-twisted search algorithm, and new linear codes. 2199-2212 - Liang Bai, Zihui Liu
On the third greedy weight of 4-dimensional codes. 2213-2230 - Matvei Kotov
An attack on the Walnut digital signature algorithm. 2231-2250 - Junying Liu, Yupeng Jiang, Qunxiong Zheng
A new construction of zero-difference balanced functions and two applications. 2251-2265 - Tian Tian
On the uniqueness of a type of cascade connection representations for NFSRs. 2267-2294 - Umberto Martínez-Peñas
Theory of supports for linear codes endowed with the sum-rank metric. 2295-2320 - Qichun Wang
Hadamard matrices, d-linearly independent sets and correlation-immune Boolean functions with minimum Hamming weights. 2321-2333 - Reza Sobhani
A note on good permutation codes from Reed-Solomon codes. 2335-2340 - Hadi Kharaghani, Sho Suda
Linked systems of symmetric group divisible designs of type II. 2341-2360 - Jon-Lark Kim, Junyong Park, Soohak Choi:
Steganographic schemes from perfect codes on Cayley graphs. 2361-2374 - Bhaskar Bagchi:
A coding theoretic approach to the uniqueness conjecture for projective planes of prime order. 2375-2389 - Minglong Qi, Shengwu Xiong
A correction to: on the linear complexity of the Sidelnikov-Lempel-Cohn-Eastman sequences. 2391-2393 - Minjia Shi, Patrick Solé:
Three-weight codes, triple sum sets, and strongly walk regular graphs. 2395-2404 - José Andrés Armario
Generalized binary arrays from quasi-orthogonal cocycles. 2405-2417 - Yuan Cao, Yonglin Cao
Construction and enumeration for self-dual cyclic codes over Z4 of oddly even length. 2419-2446 - Shuxing Li
On the weight distribution of second order Reed-Muller codes and their relatives. 2447-2460
Volume 87, Number 11, November 2019
- Marco Buratti
Partitioned difference families versus zero-difference balanced functions. 2461-2467 - Ana-Isabel Gómez
A probabilistic analysis on a lattice attack against DSA. 2469-2488 - Masaya Yasuda, Junpei Yamaguchi:
A new polynomial-time variant of LLL with deep insertions for decreasing the squared-sum of Gram-Schmidt lengths. 2489-2505 - Iwan M. Duursma
Matrix theory for minimal trellises. 2507-2536 - Min Kyu Song
Hamming correlation properties of the array structure of Sidelnikov sequences. 2537-2551 - Yupu Hu, Huiwen Jia:
A new Gaussian sampling for trapdoor lattices with arbitrary modulus. 2553-2570 - John Sheekey
Binary additive MRD codes with minimum distance n-1 must contain a semifield spread set. 2571-2583 - Yi Ouyang
Linear complexity of generalized cyclotomic sequences of period 2pm. 2585-2596 - Sihem Mesnager, Fengrong Zhang
Further study on the maximum number of bent components of vectorial functions. 2597-2610 - Yiwei Zhang
A general private information retrieval scheme for MDS coded databases with colluding servers. 2611-2623 - Zixiang Xu
New theoretical bounds and constructions of permutation codes under block permutation metric. 2625-2637 - Theodoulos Garefalakis, Giorgos Kapetanakis
Further Results on the Morgan-Mullen Conjecture. 2639-2654 - Jerod Michel, Qi Wang
Partial geometric designs from group actions. 2655-2670 - Kevin M. Byrnes
The maximum length of circuit codes with long bit runs and a new characterization theorem. 2671-2681 - Dong Yang, Wen-Feng Qi, Hua-Jin Chen:
Provable security against impossible differential and zero correlation linear cryptanalysis of some feistel structures. 2683-2700 - Siaw-Lynn Ng, Maura B. Paterson:
Functional repair codes: a view from projective geometry. 2701-2722 - Xiaoqin Zhan
Flag-transitive 2-designs from PSL(2, q) with block size 4. 2723-2728
Volume 87, Number 12, December 2019
- Peter J. Dukes
Constructions and uses of incomplete pairwise balanced designs. 2729-2751 - Chong Shangguan
A new piggybacking design for systematic MDS storage codes. 2753-2770 - Alexander A. Davydov
New covering codes of radius R, codimension tR and $$tR+\frac{R}{2}$$, and saturating sets in projective spaces. 2771-2792 - Chunming Tang
Steiner systems $$S(2, 4, \frac{3^m-1}{2})$$ and 2-designs from ternary linear codes of length $$\frac{3^m-1}{2}$$. 2793-2811 - Claude Carlet, Chengju Li, Sihem Mesnager:
Some (almost) optimally extendable linear codes. 2813-2834 - Tran van Trung:
Recursive constructions for s-resolvable t-designs. 2835-2845 - Ron Steinfeld
Practical $$\mathsf {MP} \text{- }\mathsf {LWE} $$ -based encryption balancing security-risk versus efficiency. 2847-2884 - Guomin Yang
Strongly leakage resilient authenticated key exchange, revisited. 2885-2911 - Qi Chen
Efficient explicit constructions of compartmented secret sharing schemes. 2913-2940 - San Ling
Multidimensional quasi-twisted codes: equivalent characterizations and their relation to multidimensional convolutional codes. 2941-2965 - Dávid Mezofi, Gábor Péter Nagy
On the geometry of full points of abstract unitals. 2967-2978 - Terry Shue Chien Lau
New rank codes based encryption scheme using partial circulant matrices. 2979-2999 - Qian Wang
More accurate results on the provable security of AES against impossible differential cryptanalysis. 3001-3018 - Julia Lieb
Necessary field size and probability for MDP and complete MDP convolutional codes. 3019-3043 - Yujuan Sun
Construction of resilient Boolean functions in odd variables with strictly almost optimal nonlinearity. 3045-3062 - Claude Carlet, Chengju Li, Sihem Mesnager:
Linear codes with small hulls in semi-primitive case. 3063-3075 - Zihui Liu
Linear complementary dual codes over rings. 3077-3086
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 2025-01-26 23:35 CET 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: