Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDesigns, Codes and Cryptography, Volume 90
Volume 90, Number 1, January 2022
- Xia Li, Qin Yue, Deng Tang
:
A family of linear codes from constant dimension subspace codes. 1-15 - Kwangsu Lee, Minhye Seo:
Functional encryption for set intersection in the multi-client setting. 17-47 - Fei Li, Xiumei Li:
Weight distributions and weight hierarchies of a family of p-ary linear codes. 49-66 - Ville Junnila, Tero Laihonen, Tuomo Lehtilä:
Improved lower bound for locating-dominating codes in binary Hamming spaces. 67-85 - Yuwen Huang, Chengju Li, Qi Wang, Zongrun Du:
Parameters and characterizations of hulls of some projective narrow-sense BCH codes. 87-106 - Haoxuan Wu, Jincheng Zhuang:
Improving the Gaudry-Schost algorithm for multidimensional discrete logarithms. 107-119 - Junru Ma, Jinquan Luo:
MDS symbol-pair codes from repeated-root cyclic codes. 121-137 - Vitaly Roman'kov:
An improvement of the Diffie-Hellman noncommutative protocol. 139-153 - Shiyao Chen, Yanhong Fan, Ling Sun, Yong Fu, Haibo Zhou, Yongqing Li, Meiqin Wang, Weijia Wang, Chun Guo:
SAND: an AND-RX Feistel lightweight block cipher supporting S-box-based security evaluations. 155-198 - Bart De Bruyn, Mou Gao:
Pseudo-embeddings and quadratic sets of quadrics. 199-213 - Anirban Ghatak:
Extending Coggia-Couvreur attack on Loidreau's rank-metric cryptosystem. 215-238 - Qi Cheng, Jun Zhang, Jincheng Zhuang:
LWE from non-commutative group rings. 239-263
Volume 90, Number 2, February 2022
- Nian Li, Zhao Hu, Maosheng Xiong, Xiangyong Zeng:
A note on "Cryptographically strong permutations from the butterfly structure". 265-276 - Keisuke Hara, Takahiro Matsuda, Goichiro Hanaoka, Keisuke Tanaka:
Generic transformation from broadcast encryption to round-optimal deniable ring authentication. 277-316 - Joe Gildea, Adrian Korban, Adam Michael Roberts:
New binary self-dual codes of lengths 80, 84 and 96 from composite matrices. 317-342 - Soumak Biswas, Maheshanand Bhaintwal:
Quantum codes from $\mathbb {Z}_2\mathbb {Z}_2[u]/\langle u^4 \rangle $-cyclic codes. 343-366 - Rong Pan, R. Julian R. Abel, Yudhistira A. Bunjamin, Tao Feng, Tiana J. Tsang Ung, Xiaomiao Wang:
Difference matrices with five rows over finite abelian groups. 367-386 - Xiao-Juan Wang, Tian Tian, Wen-Feng Qi:
A generic method for investigating nonsingular Galois NFSRs. 387-408 - Steven T. Dougherty:
The neighbor graph of binary self-dual codes. 409-425 - Marcel Fernandez, Jorge Jiménez Urroz:
A study of the separating property in Reed-Solomon codes by bounding the minimum distance. 427-442 - Fatih Demirbas, Orhun Kara:
Integral characteristics by keyspace partitioning. 443-472 - Ulrich Dempwolff:
Correction to: CCZ equivalence of power functions. 473-475 - Aart Blokhuis, Maarten De Boeck, Jozefien D'haeseleer:
Correction to: Cameron-Liebler sets of k-spaces in ${{\, \mathrm{PG}\, }}(n, q)$. 477-487
Volume 90, Number 3, March 2022
- Deepak Kumar Dalai, Santu Pal, Santanu Sarkar:
A state bit recovery algorithm with TMDTO attack on Lizard and Grain-128a. 489-521 - Olav Geil:
From primary to dual affine variety codes over the Klein quartic. 523-543 - Xiaofang Xu, Xiangyong Zeng, Shasha Zhang:
Regular complete permutation polynomials over ${\mathbb {F}}_{2^{n}}$. 545-575 - Jiang Liu, Qin Li, Junyu Quan, Can Wang, Jinjing Shi, Haozhen Situ:
Efficient quantum homomorphic encryption scheme with flexible evaluators and its simulation. 577-591 - Moritz Wiese, Holger Boche:
Mosaics of combinatorial designs for information-theoretic security. 593-632 - Jan De Beule, Jonathan Mannaert, Leo Storme:
Cameron-Liebler k-sets in subspaces and non-existence conditions. 633-651 - H. Zhao, Yongzhuang Wei, Fengrong Zhang, Enes Pasalic, Nastja Cepak:
Two secondary constructions of bent functions without initial conditions. 653-679 - Pan Tan, Cuiling Fan, Sihem Mesnager, Wei Guo:
Linear codes from support designs of ternary cyclic codes. 681-693 - Terry Shue Chien Lau, Chik How Tan:
On the design and security of Lee metric McEliece cryptosystems. 695-717 - Quan Yuan, Mehdi Tibouchi, Masayuki Abe:
On subset-resilient hash function families. 719-758 - Charul Rajput, Maheshanand Bhaintwal:
On the locality of quasi-cyclic codes over finite fields. 759-777 - Dibyayoti Jena, Geertrui Van de Voorde:
The geometric field of linearity of linear sets. 779-799 - Dmitrii I. Koshelev:
Indifferentiable hashing to ordinary elliptic ${\mathbb {F}}_{\!q}$-curves of j=0 with the cost of one exponentiation in ${\mathbb {F}}_{\!q}$. 801-812 - Mengzhen Zhao, Cuiling Fan, Zihong Tian:
Nearly optimal balanced quaternary sequence pairs of prime period N=uiv 5±od 8. 813-826 - Tim Penttila:
Uniqueness of the inversive plane of order sixty-four. 827-834
Volume 90, Number 4, April 2022
- Kevin M. Byrnes:
Isomorphism of maximum length circuit codes. 835-850 - Liantao Lan, Yanxun Chang, Lidong Wang:
The completion of optimal cyclic quaternary codes of weight 3 and distance 3. 851-862 - Yanwei Zhao, Shenglin Zhou:
Flag-transitive 2-(v, k, λ ) designs with r>λ (k-3). 863-869 - Rajendra M. Pawale, Mohan S. Shrikhande, Kusum S. Rajbhar:
Non-existence of quasi-symmetric designs with restricted block graphs. 871-879 - Luka Music, Céline Chevalier, Elham Kashefi:
Dispelling myths on superposition attacks: formal security model and attack analyses. 881-920 - Yi Zhao, Kaitai Liang, Yanqi Zhao, Bo Yang, Yang Ming, Emmanouil Panaousis:
Practical algorithm substitution attack on extractable signatures. 921-937 - Alexander Barg, Zitan Chen, Itzhak Tamo:
A construction of maximally recoverable codes. 939-945 - Daiki Kawabata, Tatsuya Maruta:
On the nonexistence of ternary linear codes attaining the Griesmer bound. 947-956 - Paolo Santonastaso, Ferdinando Zullo:
On the list decodability of rank-metric codes containing Gabidulin codes. 957-982 - Orr Dunkelman, Maria Eichlseder, Daniel Kales, Nathan Keller, Gaëtan Leurent, Markus Schofnegger:
Practical key recovery attacks on FlexAEAD. 983-1007 - Christof Beierle, Gregor Leander, Léo Perrin:
Trims and extensions of quadratic APN functions. 1009-1036 - Dipak K. Bhunia, Cristina Fernández-Córdoba, Mercè Villanueva:
On the linearity and classification of ${\mathbb {Z}}_{p^s}$-linear generalized hadamard codes. 1037-1058 - Janaka Alawatugoda, Tatsuaki Okamoto:
Standard model leakage-resilient authenticated key exchange using inner-product extractors. 1059-1079 - Nurdagül Anbar, Wilfried Meidl:
Bent partitions. 1081-1101
Volume 90, Number 5, May 2022
- Carlos Galindo, Fernando Hernando:
On the generalization of the construction of quantum codes from Hermitian self-orthogonal codes. 1103-1112 - Hongwei Zhu, Minjia Shi, Ferruh Özbudak:
Complete b-symbol weight distribution of some irreducible cyclic codes. 1113-1125 - Kai Lin Ong, Ang Miin Huey:
On equivalence of cyclic and dihedral zero-divisor codes having nilpotents of nilpotency degree two as generators. 1127-1138 - WeiGuo Zhang, Enes Pasalic, Liupiao Zhang:
Phase orthogonal sequence sets for (QS)CDMA communications. 1139-1156 - Fucai Luo, Saif M. Al-Kuwari:
Attribute-based signatures from lattices: unbounded attributes and semi-adaptive security. 1157-1177 - Zhenyu Lu, Sihem Mesnager, Tingting Cui, Yanhong Fan, Meiqin Wang:
An STP-based model toward designing S-boxes with good cryptographic properties. 1179-1202 - Felix Lazebnik, Lorinda Leshock:
On Pappus configurations in Hall planes. 1203-1219 - Hui Zhang, Cuiling Fan, Sihem Mesnager:
Constructions of two-dimensional Z-complementary array pairs with large ZCZ ratio. 1221-1239 - Nuh Aydin, Peihan Liu, Bryan Yoshino:
Polycyclic codes associated with trinomials: good codes and open questions. 1241-1269 - Gaojun Luo, San Ling:
Application of optimal p-ary linear codes to alphabet-optimal locally repairable codes. 1271-1287 - Fengrong Zhang, Enes Pasalic, René Rodríguez, Yongzhuang Wei:
Minimal binary linear codes: a general framework based on bent concatenation. 1289-1318
Volume 90, Number 6, June 2022
- Can Xiang, Chunming Tang, Qi Liu:
An infinite family of antiprimitive cyclic codes supporting Steiner systems S(3, 8, 7m+1). 1319-1333 - Michael Kiermaier:
On α-points of q-analogs of the Fano plane. 1335-1345 - Valerio Dose, Pietro Mercuri, Ankan Pal, Claudio Stirpe:
High order elements in finite fields arising from recursive towers. 1347-1368 - Engin Senel, Figen Öke:
On the automorphisms of generalized algebraic geometry codes. 1369-1379 - Arghya Bhattacharjee, Avijit Dutta, Eik List, Mridul Nandi:
CENCPP*: beyond-birthday-secure encryption from public permutations. 1381-1425 - Austin Dukes, Andrea Ferraguti, Giacomo Micheli:
Optimal selection for good polynomials of degree up to five. 1427-1436 - Kwang Ho Kim, Sihem Mesnager, Jong Hyok Choe, Dok Nam Lee, Sengsan Lee, Myong Chol Jo:
On permutation quadrinomials with boomerang uniformity 4 and the best-known nonlinearity. 1437-1461 - Jinming Wen, Xiao-Wen Chang:
Sharper bounds on four lattice constants. 1463-1484 - Tsuyoshi Miezaki, Hiroyuki Nakasora:
A note on the Assmus-Mattson theorem for some binary codes. 1485-1502 - Angela Aguglia, Michela Ceria, Luca Giuzzi:
Some hypersurfaces over finite fields, minimal codes and secret sharing schemes. 1503-1519 - Dean Crnkovic, Daniel R. Hawtin, Andrea Svob:
Neighbour-transitive codes and partial spreads in generalised quadrangles. 1521-1533 - Luka Music, Céline Chevalier, Elham Kashefi:
Correction to: Dispelling myths on superposition attacks: formal security model and attack analyses. 1535
Volume 90, Number 7, July 2022
- Ferruh Özbudak, Burcu Gülmez Temür:
Classification of permutation polynomials of the form x3g(xq-1) of 픽q2 where g(x)=x3+bx+c and $b, c \in {\mathbb F}_q^*$. 1537-1556 - Simeon Ball, James Dixon:
The equivalence of linear codes implies semi-linear equivalence. 1557-1565 - Tran van Trung:
A method of constructing 2-resolvable t-designs for t=3, 4. 1567-1583 - Dean Crnkovic, Andrea Svob:
Switching for 2-designs. 1585-1593 - Vladimir D. Tonchev:
Book Review: "Designs from Linear Codes", second edition, by Cunsheng Ding and Chunming Tang, World Scientific, 2022. 1595-1597 - Jingjun Bao, Lijun Ji:
Large sets of t-designs over finite fields exist for all t. 1599-1609 - Menglong Zhang, Tao Feng, Xiaomiao Wang:
The existence of cyclic (v, 4, 1)-designs. 1611-1628 - Xia Li, Qin Yue:
Non-binary irreducible quasi-cyclic parity-check subcodes of Goppa codes and extended Goppa codes. 1629-1647 - Jun Zhang, Zhengchun Zhou, Chunming Tang:
A class of twisted generalized Reed-Solomon codes. 1649-1658 - Sergey Bereg, Brian Malouf, Linda Morales, Thomas Stanley, Ivan Hal Sudborough:
Using permutation rational functions to obtain permutation arrays with large hamming distance. 1659-1677 - Adrian Korban, Serap Sahinkaya, Deniz Ustun:
Reversible Gk-codes with applications to DNA codes. 1679-1694
Volume 90, Number 8, August 2022
- Yan Wang, Xilin Han, Weiqiong Wang, Ziling Heng:
Linear complexity over ${\mathbb {F}_{{q}}}$ and 2-adic complexity of a class of binary generalized cyclotomic sequences with good autocorrelation. 1695-1712 - Alexander M. Romanov:
On the number of q-ary quasi-perfect codes with covering radius 2. 1713-1719 - Khodakhast Bibak, Behrouz Zolfaghari:
The Modular Subset-Sum Problem and the size of deletion correcting codes. 1721-1734 - Jung Hee Cheon, Wonhee Cho, Jeong Han Kim, Jiseung Kim:
Adventures in crypto dark matter: attacks, fixes and analysis for weak pseudorandom functions. 1735-1760 - Samaneh Mashahdi, Bagher Bagherpour, Ali Zaghian:
A non-interactive (t, n)-publicly verifiable multi-secret sharing scheme. 1761-1782 - Sadmir Kudin, Enes Pasalic:
A complete characterization of ${\mathcal {D}}_0 \cap {\mathcal {M}}^\#$ and a general framework for specifying bent functions in C outside M#. 1783-1796 - Seyyed Arash Azimi, Adrián Ranea, Mahmoud Salmasizadeh, Javad Mohajeri, Mohammad Reza Aref, Vincent Rijmen:
A bit-vector differential model for the modular addition by a constant and its applications to differential and impossible-differential cryptanalysis. 1797-1855 - Lidong Wang, Lulu Cai, Tao Feng, Zihong Tian, Xiaomiao Wang:
Geometric orthogonal codes and geometrical difference packings. 1857-1879 - Marién Abreu, Martin Funk, Vedran Krcadinac, Domenico Labbate:
Strongly regular configurations. 1881-1897 - Katharina Boudgoust, Amin Sakzad, Ron Steinfeld:
Vandermonde meets Regev: public key encryption schemes based on partial Vandermonde problems. 1899-1936 - Junzhen Sui, Xiaomeng Zhu, Xueying Shi:
MDS and near-MDS codes via twisted Reed-Solomon codes. 1937-1958
Volume 90, Number 9, September 2022
- Simeon Ball, Michel Lavrauw, Tamás Szonyi:
Contributions by Aart Blokhuis to finite geometry, discrete mathematics, and combinatorics. 1959-1961 - Bart De Bruyn, Mou Gao:
A characterization of the Coxeter cap. 1963-1981 - Willem H. Haemers, Leila Parsaei Majd:
Spectral symmetry in conference matrices. 1983-1990 - Oliver Janzer, Zoltán Lóránt Nagy:
Coloring linear hypergraphs: the Erdős-Faber-Lovász conjecture and the Combinatorial Nullstellensatz. 1991-2001 - Aida Abiad, Bart De Bruyn, Jozefien D'haeseleer, Jack H. Koolen:
Neumaier graphs with few eigenvalues. 2003-2019 - Michel Lavrauw, Tomasz Popiel, John Sheekey:
Combinatorial invariants for nets of conics in $\mathrm {PG}(2, q)$. 2021-2067 - Rosemary A. Bailey, Peter J. Cameron, Michael Kinyon, Cheryl E. Praeger:
Diagonal groups and arcs over groups. 2069-2080 - Giovanni Longobardi, Leo Storme, Rocco Trombetti:
On sets of subspaces with two intersection dimensions and a geometrical junta bound. 2081-2099 - Aart Blokhuis, Maarten De Boeck, Jozefien D'haeseleer:
On the sunflower bound for k-spaces, pairwise intersecting in a point. 2101-2111 - Lins Denaux:
Constructing saturating sets in projective spaces using subgeometries. 2113-2144 - William M. Kantor:
Automorphism subgroups for designs with λ =1. 2145-2157 - Anton Betten, Fatma Karaoglu:
The Eckardt point configuration of cubic surfaces revisited. 2159-2180 - Xinyu Tan, Narayanan Rengaswamy, A. Robert Calderbank:
Approximate unitary 3-designs from transvection Markov chains. 2181-2204 - Carmen Amarra, Alice Devillers, Cheryl E. Praeger:
Delandtsheer-Doyen parameters for block-transitive point-imprimitive 2-designs. 2205-2221 - Aart Blokhuis, Ruud Pellikaan, Tamás Szonyi:
The extended coset leader weight enumerator of a twisted cubic code. 2223-2247
Volume 90, Number 10, October 2022
- Hyun Kwang Kim, Jieun Kwon:
Classification of weighted posets and digraphs admitting the extended Hamming code to be a perfect code. 2249-2269 - Masayuki Abe, Miguel Ambrona:
Blind key-generation attribute-based encryption for general predicates. 2271-2299 - Shweta Agrawal, Rajarshi Biswas, Ryo Nishimaki, Keita Xagawa, Xiang Xie, Shota Yamada:
Cryptanalysis of Boyen's attribute-based encryption scheme in TCC 2013. 2301-2318 - Abbas Alhakim:
Designing preference functions for de Bruijn sequences with forbidden words. 2319-2335 - Junru Ma, Jinquan Luo:
Constructions of MDS symbol-pair codes with minimum distance seven or eight. 2337-2359 - Hamidreza Eyvazi, Karim Samei, Batoul Savari:
The linearity of Carlet's Gray image of linear codes over ${\mathbb {Z}}_{8}$. 2361-2373 - Daniel Horsley, Padraig Ó Catháin:
Block avoiding point sequencings of partial Steiner systems. 2375-2383 - Haode Yan, Kun Zhang:
On the c-differential spectrum of power functions over finite fields. 2385-2405 - Yagmur Çakiroglu, Oguz Yayla, Emrah Sercan Yilmaz:
The number of irreducible polynomials over finite fields with vanishing trace and reciprocal trace. 2407-2417 - Jun Liu, Dachao Wang, Yupu Hu, Jie Chen, Baocang Wang:
Improved key-recovery attacks on reduced-round WEM-8. 2419-2448 - Zhaocun Zhou, Dengguo Feng, Bin Zhang:
Efficient and extensive search for precise linear approximations with high correlations of full SNOW-V. 2449-2479 - Gerald J. Janusz:
Covering polynomials and projections of self-dual codes. 2481-2489 - Lijun Ji, Miao Liang, Yanting Wang:
Combinational constructions of splitting authentication codes with perfect secrecy. 2491-2515
Volume 90, Number 11, November 2022
- W. Cary Huffman, Jon-Lark Kim, Patrick Solé:
Guest editorial: On coding theory and combinatorics - in memory of Vera Pless. 2517-2527 - Jian Gao, Xiangrui Meng, Fang-Wei Fu:
Weight distribution of double cyclic codes over Galois rings. 2529-2549 - Rongsheng Wu, Minjia Shi:
On $\mathbb {Z}_2\mathbb {Z}_4$-additive polycyclic codes and their Gray images. 2551-2562 - Federico N. Martínez:
Symmetric functions and spherical t-designs in $\pmb {\mathbb {R}^2}$. 2563-2581 - Himadri Shekhar Chakraborty, Tsuyoshi Miezaki:
Variants of Jacobi polynomials in coding theory. 2583-2597 - Minjia Shi, Shukai Wang, Tor Helleseth, Patrick Solé:
Quadratic residue codes, rank three groups and PBIBDs. 2599-2611 - Rongcun Qin, Hengming Zhao, Huangsheng Yu:
Compatible difference packing set systems and their applications to multilength variable-weight OOCs. 2613-2645 - Martino Borello, Cem Güneri, Elif Saçikara, Patrick Solé:
The concatenated structure of quasi-abelian codes. 2647-2661 - Liqin Qian, Xiwang Cao, Wei Lu, Patrick Solé:
A new method for constructing linear codes with small hulls. 2663-2682 - Serhii Dyshko, Jay A. Wood:
MacWilliams extension property for arbitrary weights on linear codes over module alphabets. 2683-2701 - Yuqing Fu, Hongwei Liu:
Galois self-orthogonal constacyclic codes over finite fields. 2703-2733 - Whan-Hyuk Choi, Jon-Lark Kim:
An improved upper bound on self-dual codes over finite fields GF(11), GF(19), and GF(23). 2735-2751 - Vladimir D. Tonchev:
On Pless symmetry codes, ternary QR codes, and related Hadamard matrices and designs. 2753-2762 - Shikha Patel, Om Prakash:
(θ , δ θ )-Cyclic codes over $\mathbb {F}_q[u, v]/\langle u^2-u, v^2-v, uv-vu \rangle $. 2763-2781
Volume 90, Number 12, December 2022
- Stéphane Ballet, Nicolas Baudru, Alexis Bonnecaze, Mila Tukumuli:
Construction of asymmetric Chudnovsky-type algorithms for multiplication in finite fields. 2783-2811 - Yansheng Wu, Yoonjin Lee, Qiang Wang:
Further improvement on index bounds. 2813-2821 - Lin Sok:
A new construction of linear codes with one-dimensional hull. 2823-2839 - Fatemeh Jafari, Alireza Abdollahi, Javad Bagherian, Maryam Khatami, Reza Sobhani:
Equidistant permutation group codes. 2841-2859 - Edoukou Berenger Ayebie, El Mamoun Souidi:
New code-based cryptographic accumulator and fully dynamic group signature. 2861-2891 - Hokuto Takahashi, Manabu Hagiwara:
Decoding algorithms of monotone codes and azinv codes and their unified view. 2893-2922 - Iwan M. Duursma, Xiao Li:
Johnson graph codes. 2923-2941 - Jessica Bariffi, Sam Mattheus, Alessandro Neri, Joachim Rosenthal:
Moderate-density parity-check codes from projective bundles. 2943-2966 - Jon-Lark Kim, Junyong Park:
Steganography from perfect codes on Cayley graphs over Gaussian integers, Eisenstein-Jacobi integers and Lipschitz integers. 2967-2989 - Xianmang He, Yindong Chen, Zusheng Zhang, Kunxiao Zhou:
Parallel sub-code construction for constant-dimension codes. 2991-3001 - Adel Alahmadi, Amani Alkathiry, Alaa Altassan, Alexis Bonnecaze, Hatoon Shoaib, Patrick Solé:
The build-up construction over a commutative non-unital ring. 3003-3010 - Slim Bettaieb, Loïc Bidoux, Olivier Blazy, Yann Connan, Philippe Gaborit:
A gapless code-based hash proof system based on RQC and its applications. 3011-3044
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-04-29 21:42 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:
