default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCryptography and Communications, Volume 11
Volume 11, Number 1, January 2019
- Lilya Budaghyan, Claude Carlet, Tor Helleseth:
Editorial: Special Issue on Boolean functions and their applications. 1-2 - Irene Villa
:
On APN functions L 1(x 3) + L 2(x 9) with linear L 1 and L 2. 3-20 - Valeriya Idrisova:
On an algorithm generating 2-to-1 APN functions and its applications to "the big APN problem". 21-39 - Luca Mariot, Stjepan Picek, Alberto Leporati, Domagoj Jakobovic:
Cellular automata based S-boxes. 41-62 - Sihem Mesnager, Zhengchun Zhou, Cunsheng Ding:
On the nonlinearity of Boolean functions with restricted input. 63-76 - Bimal Mandal, Pantelimon Stanica, Sugata Gangopadhyay:
New classes of p-ary bent functions. 77-92 - Çagdas Çalik, Meltem Sönmez Turan, René Peralta:
The multiplicative complexity of 6-variable Boolean functions. 93-107 - Joan Boyar, Magnus Gausdal Find, René Peralta:
Small low-depth circuits for cryptographic applications. 109-127 - Nian Li, Tor Helleseth:
New permutation trinomials from Niho exponents over finite fields with even characteristic. 129-136
Volume 11, Number 2, March 2019
- Hongwei Liu, Youcef Maouche:
Several new classes of linear codes with few weights. 137-146 - Umberto Martínez-Peñas:
Universal secure rank-metric coding schemes with optimal communication overheads. 147-166 - Lin Wang, Zhi Hu:
Injectivity on distribution of elements in the compressed sequences derived from primitive sequences over ℤpe. 167-189 - Jerod Michel, Qi Wang:
Some new balanced and almost balanced quaternary sequences with low autocorrelation. 191-206 - Enes Pasalic, Samir Hodzic, Fengrong Zhang, Yongzhuang Wei:
Bent functions from nonlinear permutations and conversely. 207-225 - Huali Deng, Dabin Zheng:
More classes of permutation trinomials with Niho exponents. 227-236 - Olav Geil, Ferruh Özbudak:
On affine variety codes from the Klein quartic. 237-257 - Haode Yan:
A note on the constructions of MDS self-dual codes. 259-268 - Qichun Wang, Pantelimon Stanica:
New bounds on the covering radius of the second order Reed-Muller code of length 128. 269-277 - Kangquan Li, Longjiang Qu, Qiang Wang:
Compositional inverses of permutation polynomials of the form x r h(x s ) over finite fields. 279-298 - Zhe Gao, Chao Li, Yue Zhou:
Upper bounds and constructions of complete Asynchronous channel hopping systems. 299-312 - Gaofei Wu, Nian Li:
Several classes of permutation trinomials over 𝔽5n from Niho exponents. 313-324 - Mohammad Ashraf, Ghulam Mohammad:
Quantum codes over F p from cyclic codes over F p [u, v]/〈u 2 - 1, v 3 - v, u v - v u〉. 325-335 - Yuhua Sun, Qiang Wang, Tongjiang Yan:
A lower bound on the 2-adic complexity of the modified Jacobi sequence. 337-349 - Saeed Rostami, Elham Shakour, Mohammad Ali Orumiehchiha, Josef Pieprzyk:
Cryptanalysis of WG-8 and WG-16 stream ciphers. 351-362
Volume 11, Number 3, May 2019
- Lilya Budaghyan, Chunlei Li, Matthew Geoffrey Parker:
Editorial: Special Issue on Mathematical Methods for Cryptography. 363-365 - Kaisa Nyberg:
Affine linear cryptanalysis. 367-377 - Svetla Nikova, Ventzislav Nikov, Vincent Rijmen:
Decomposition of permutations in a finite field. 379-384 - Kerem Varici, Svetla Nikova, Ventzislav Nikov, Vincent Rijmen:
Constructions of S-boxes with uniform sharing. 385-398 - László Csirmaz, Péter Ligeti:
Secret sharing on large girth graphs. 399-410 - Yao Chen, Benjamin M. Case, Shuhong Gao, Guang Gong:
Error analysis of weak Poly-LWE instances. 411-426 - Patrick Felke:
On the security of biquadratic C ∗ public-key cryptosystems and its generalizations. 427-442 - Håvard Raddum, Srimathi Varadharajan:
Factorization using binary decision diagrams. 443-460 - Victor A. Zinoviev:
On classical Kloosterman sums. 461-496 - Assen Bojilov, Lyubomir Borissov, Yuri L. Borissov:
Computing the number of finite field elements with prescribed absolute trace and co-trace. 497-507 - Nian Li, Xiangyong Zeng:
A survey on the applications of Niho exponents. 509-548 - Torleiv Kløve:
Codes of length two correcting single errors of limited size. 549-555
Volume 11, Number 4, July 2019
- Marco Buratti:
Hadamard partitioned difference families and their descendants. 557-562 - Ziran Tu, Xiangyong Zeng:
A class of permutation trinomials over finite fields of odd characteristic. 563-583 - Diego Napp, Ricardo Pereira, Raquel Pinto, Paula Rocha:
Periodic state-space representations of periodic convolutional codes. 585-595 - Masaaki Harada:
Singly even self-dual codes of length 24k + 10 and minimum weight 4k + 2. 597-608 - Shudi Yang, Qin Yue, Yansheng Wu, Xiangli Kong:
Complete weight enumerators of a class of two-weight linear codes. 609-620 - Ville Junnila, Tero Laihonen, Gabrielle Paris:
Optimal bounds on codes for location in circulant graphs. 621-640 - Selçuk Kavut, Sevdenur Baloglu:
Results on symmetric S-boxes constructed by concatenation of RSSBs. 641-660 - LiMengNan Zhou, Daiyuan Peng, Xing Liu, Hongyu Han, Zheng Ma:
Frequency-hopping sequence sets with good aperiodic Hamming correlation property. 661-675 - Masaaki Harada, Ken Saito:
Binary linear complementary dual codes. 677-696 - Sabyasachi Dey, Santanu Sarkar:
Settling the mystery of Z r = r in RC4. 697-715 - Liqin Qian, Minjia Shi, Patrick Solé:
On self-dual and LCD quasi-twisted codes of index two over a special chain ring. 717-734 - Zibi Xiao, Xiangyong Zeng, Chaoyun Li, Yupeng Jiang:
Binary sequences with period N and nonlinear complexity N - 2. 735-757 - Gang Wang, Min-Yao Niu, Fang-Wei Fu:
Deterministic constructions of compressed sensing matrices based on codes. 759-775 - Alexey Oblaukhov:
A lower bound on the size of the largest metrically regular subset of the Boolean cube. 777-791 - Anastasiya Gorodilova:
On the differential equivalence of APN functions. 793-813 - Yu Li, Tongjiang Yan, Chuan Lv:
Construction of a Near-Optimal Quasi-Complementary Sequence Set from Almost Difference Set. 815-824 - Gaojun Luo, Xiwang Cao:
Two constructions of asymptotically optimal codebooks. 825-838
Volume 11, Number 5, September 2019
- Joan-Josep Climent, Verónica Requena, Xaro Soler-Escrivà:
A construction of Abelian non-cyclic orbit codes. 839-852 - Gaofei Wu, Matthew Geoffrey Parker:
On Boolean functions with several flat spectra. 853-880 - Antti Laaksonen, Patric R. J. Östergård:
New lower bounds on q-ary error-correcting codes. 881-889 - Nuh Aydin, Ghada Bakbouk, Jonathan G. G. Lambrinos:
New linear codes over non-prime fields. 891-902 - Daniele Bartoli, Alexander A. Davydov, Massimo Giulietti, Stefano Marcugini, Fernanda Pambianco:
New bounds for linear codes of covering radii 2 and 3. 903-920 - Muhiddin Uguz, Ali Doganaksoy, Fatih Sulak, Onur Koçak:
R-2 composition tests: a family of statistical randomness tests for a collection of binary sequences. 921-949 - Lin Wang, Zhi Hu:
New explicit injective compressing mappings on primitive sequences over ℤ p e $\mathbb {Z}_{p^e}$. 951-963 - Hila Rabii, Osnat Keren:
A new class of security oriented error correcting robust codes. 965-978 - Ying Gao, Zihui Liu, Yiwei Liu:
The separation of binary relative three-weight codes and its applications. 979-992 - Richard Hofer, Arne Winterhof:
r-th order nonlinearity, correlation measure and least significant bit of the discrete logarithm. 993-997 - Avaz Naghipour:
New classes of quantum codes on closed orientable surfaces. 999-1008 - Trygve Johnsen, Hugues Verdure:
Relative profiles and extended weight polynomials of almost affine codes. 1009-1020 - Ismael Gutiérrez García, Daladier Jabba Molinares, Ivan Molina Naizir:
A novel maximum distance separable code to generate universal identifiers. 1021-1035 - Yana Liang, Jiali Cao, Xingfa Chen, Shiping Cai, Xiang Fan:
Linear complexity of Ding-Helleseth generalized cyclotomic sequences of order eight. 1037-1056 - Libo Wang, Baofeng Wu, Xiaoqiang Yue, Yanbin Zheng:
Further results on permutation trinomials with Niho exponents. 1057-1068 - Aleksandar Radonjic, Vladimir Vujicic:
Integer codes correcting sparse byte errors. 1069-1077 - Samir Hodzic, Enes Pasalic, Anupam Chattopadhyay:
An iterative method for linear decomposition of index generating functions. 1079-1102 - Cem Güneri, Ferruh Özbudak, Elif Saçikara:
A concatenated construction of linear complementary pair of codes. 1103-1114 - Allison Beemer, Kathryn Haymaker, Christine A. Kelley:
Absorbing sets of codes from finite geometries. 1115-1131 - Chunming Tang, Yanfeng Qi, Dongmei Huang:
Regular p-ary bent functions with five terms and Kloosterman sums. 1133-1144
Volume 11, Number 6, November 2019
- Lilya Budaghyan, Claude Carlet, Tor Helleseth:
Editorial: Special issue on Boolean functions and their applications 2018. 1145-1146 - Anne Canteaut, Léo Perrin, Shizhu Tian:
If a generalised butterfly is APN then it operates on 6 bits. 1147-1164 - Nikolay S. Kaleyski:
Changing APN functions at two points. 1165-1184 - Deng Tang, Jian Liu:
A family of weightwise (almost) perfectly balanced boolean functions with optimal algebraic immunity. 1185-1197 - Xiang-dong Hou:
On a class of permutation trinomials in characteristic 2. 1199-1210 - Claude Gravel, Daniel Panario, David Thomson:
Unicyclic strong permutations. 1211-1231 - Wilfried Meidl, Alexander Pott:
Generalized bent functions into ℤ p k $\mathbb {Z}_{p^{k}}$ from the partial spread and the Maiorana-McFarland class. 1233-1245 - Sihem Mesnager, Constanza Riera, Pantelimon Stanica:
Multiple characters transforms and generalized Boolean functions. 1247-1260 - Gaojun Luo, Xiwang Cao, Sihem Mesnager:
Several new classes of self-dual bent functions derived from involutions. 1261-1273 - Nastja Cepak, Enes Pasalic, Amela Muratovic-Ribic:
Frobenius linear translators giving rise to new infinite classes of permutations and bent functions. 1275-1295 - Ferruh Özbudak, Rumi Melih Pelen:
Strongly regular graphs arising from non-weakly regular bent functions. 1297-1306 - Patrick G. Cesarz, Robert S. Coulter:
Image sets with regularity of differences. 1307-1337 - Luís T. A. N. Brandão, Çagdas Çalik, Meltem Sönmez Turan, René Peralta:
Upper bounds on the multiplicative complexity of symmetric Boolean functions. 1339-1362
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-10-31 20:15 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:
