default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAdvances in Mathematics of Communications, Volume 13
Volume 13, Number 1, February 2019
- Ryutaroh Matsumoto:
Strongly secure quantum ramp secret sharing constructed from algebraic curves over finite fields. 1-10 - Ahmed S. Mansour, Holger Boche, Rafael F. Schaefer
:
The secrecy capacity of the arbitrarily varying wiretap channel under list decoding. 11-39 - Sabyasachi Karati, Palash Sarkar:
Connecting Legendre with Kummer and Edwards. 41-66 - Riccardo Aragona, Marco Calderini, Roberto Civino, Massimiliano Sala, Ilaria Zappatore:
Wave-shaped round functions and primitive groups. 67-88 - Bagher Bagherpour, Shahrooz Janbaz, Ali Zaghian:
Optimal information ratio of secret sharing schemes on Dutch windmill graphs. 89-99 - Tim L. Alderson, Alessandro Neri:
Maximum weight spectrum codes. 101-119 - Shixiong Wang, Longjiang Qu, Chao Li, Huaxiong Wang:
Further improvement of factoring N = pr qs with partial known bits. 121-135 - Lanqiang Li, Shixin Zhu, Li Liu:
The weight distribution of a class of p-ary cyclic codes and their applications. 137-156 - Minjia Shi, Yaqi Lu:
Cyclic DNA codes over 픽2[u, v]/ u3, v2-v, vu-uv>. 157-164 - Michael Braun, Michael Kiermaier, Reinhard Laue:
New 2-designs over finite fields from derived and residual designs. 165-170 - Minjia Shi, Daitao Huang, Lin Sok, Patrick Solé:
Double circulant self-dual and LCD codes over Galois rings. 171-183 - Philip Lafrance, Alfred Menezes:
On the security of the WOTS-PRF signature scheme. 185-193 - Chengju Li, Sunghan Bae, Shudi Yang:
Some two-weight and three-weight linear codes. 195-211
Volume 13, Number 2, May 2019
- Ken Saito:
Self-dual additive 픽4-codes of lengths up to 40 represented by circulant graphs. 213-220 - Xinwei Gao:
Comparison analysis of Ding's RLWE-based key exchange protocol and NewHope variants. 221-233 - Riccardo Aragona, Alessio Meneghetti:
Type-preserving matrices and security of block ciphers. 235-251 - Sihong Su:
A new construction of rotation symmetric bent functions with maximal algebraic degree. 253-265 - Xia Li, Feng Cheng, Chunming Tang, Zhengchun Zhou:
Some classes of LCD codes and self-orthogonal codes over finite fields. 267-280 - Fatma-Zohra Benahmed, Kenza Guenda, Aicha Batoul, Thomas Aaron Gulliver:
Some new constructions of isodual and LCD codes over finite fields. 281-296 - Huangsheng Yu, Feifei Xie, Dianhua Wu, Hengming Zhao:
Further results on optimal (n, {3,4,5}, Λa, 1, Q)-OOCs. 297-312 - Martino Borello, Olivier Mila:
Symmetries of weight enumerators and applications to Reed-Muller codes. 313-328 - Wei Li, Hengming Zhao, Rongcun Qin, Dianhua Wu:
Constructions of optimal balanced (m, n, 4, 5, 1)-OOSPCs. 329-341 - Felipe Cabarcas, Daniel Cabarcas, John Baena:
Efficient public-key operation in multivariate schemes. 343-371
Volume 13, Number 3, August 2019
- Shanding Xu, Xiwang Cao, Jiafu Mi, Chunming Tang:
More cyclotomic constructions of optimal frequency-hopping sequences. 373-391 - Antonio Cossidente, Francesco Pavese, Leo Storme:
Optimal subspace codes in $ {{\rm{PG}}}(4, q) $. 393-404 - Suzana Antunovic, Tonci Kokan, Tanja Vojkovic, Damir Vukicevic:
Exponential generalised network descriptors. 405-420 - Fanghui Ma, Jian Gao, Fang-Wei Fu:
New non-binary quantum codes from constacyclic codes over $ \mathbb{F}_q[u, v]/\langle u^{2}-1, v^{2}-v, uv-vu\rangle $. 421-434 - Palash Sarkar, Shashank Singh:
A unified polynomial selection method for the (tower) number field sieve algorithm. 435-455 - Daniel Heinlein, Michael Kiermaier, Sascha Kurz, Alfred Wassermann:
A subspace code of size 333 in the setting of a binary q-analog of the Fano plane. 457-475 - Eun-Kyung Cho, Cunsheng Ding, Jong Yoon Hyun:
A spectral characterisation of t-designs and its applications. 477-503 - Nian Li, Qiaoyu Hu:
A conjecture on permutation trinomials over finite fields of characteristic two. 505-512 - Vincent Astier, Thomas Unger:
Galois extensions, positive involutions and an application to unitary space-time coding. 513-516
Volume 13, Number 4, November 2019
- Subhamoy Maitra:
Guest editorial. - Neal Koblitz, Alfred Menezes:
Critical perspectives on provable security: Fifteen years of "another look" papers. 517-558 - Qian Guo, Thomas Johansson, Erik Mårtensson, Paul Stankovski Wagner:
Some cryptanalytic and coding-theoretic applications of a soft stern algorithm. 559-578 - Pascale Charpin, Jie Peng:
Differential uniformity and the associated codes of cryptographic functions. 579-600 - Bailey Kacsmar, Douglas R. Stinson:
A network reliability approach to the analysis of combinatorial repairable threshold schemes. 601-612 - Constanza Riera, Pantelimon Stanica:
Landscape Boolean functions. 613-627 - Thaís Bardini Idalino, Lucia Moura:
Embedding cover-free families and cryptographical applications. 629-643 - Subhabrata Samajder, Palash Sarkar:
Another look at success probability of linear cryptanalysis. 645-688 - Sabyasachi Dey, Tapabrata Roy, Santanu Sarkar:
Revisiting design principles of Salsa and ChaCha. 689-704 - Nilanjan Datta, Avijit Dutta, Mridul Nandi, Kan Yasuda:
sfDWCDM+: A BBB secure nonce based MAC. 705-732 - Laltu Sardar, Sushmita Ruj:
The secure link prediction problem. 733-757 - Sikhar Patranabis, Debdeep Mukhopadhyay:
Identity-based key aggregate cryptosystem from multilinear maps. 759-778 - Kishan Chand Gupta, Sumit Kumar Pandey, Indranil Ghosh Ray, Susanta Samanta:
Cryptographically significant mds matrices over finite fields: A brief survey and some generalized results. 779-843
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-12-23 00:33 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:
