default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCryptography and Communications, Volume 17
Volume 17, Number 1, January 2025
- Yuying Man, Nian Li, Zejun Xiang, Xiangyong Zeng:
On the second-order zero differential spectra of some power functions over finite fields. 1-14 - Xinyu Tian, Hongyu Han, Udaya Parampalli:
Construction of low-hit-zone frequency-hopping sequence sets with strictly optimal partial Hamming correlation based on Chinese Remainder Theorem. 15-25 - Juan Di Mauro, Hamid Boukkerou, Gilles Millerioux, Marine Minier, Thomas Stoll:
Provable randomness over lightweight permutations. 27-40 - Nikolaos Verykios, Christos Gogos:
Structures of finite fields of primes and the Euclidean square roots of unity in the finite rings. 41-55 - Jong Yoon Hyun, Jihye Jeong, Yoonjin Lee:
Constructing optimal few weight quaternary linear codes via multivariable functions. 57-85 - Stanislav S. Malakhov
:
On the circulant matrix MDS testing and the search for circulant MDS matrices. 87-119 - Yupeng Jiang, Yifan Zhu:
Distribution of linear and second-highest degree parts of maximum-length feedback functions. 121-138 - He Zhang, Chunming Tang, Xing Hu:
Three families of large cyclic subspace codes. 139-163 - He Zhang, Chunming Tang, Xing Hu:
Correction: Three families of large cyclic subspace codes. 165 - Feifei Yan, Pinhui Ke, Zuling Chang:
The symmetric 2-adic complexity of Tang-Gong interleaved sequences from Legendre sequence pair. 167-179 - Ruhao Wan, Xiujing Zheng, Shixin Zhu:
Construction of quantum MDS codes from Hermitian self-orthogonal generalized Reed-Solomon codes. 181-205 - Yun Ding, Shixin Zhu:
A family of linear codes with few weights and their subfield codes. 207-238 - Abdelghaffar Chibloun, Hassan Ouazzou, Mustapha Najmeddine:
On isometry and equivalence of constacyclic codes over finite chain rings. 239-263 - Qinlin Cai, Xiaomiao Wang, Tao Feng:
Two-dimensional q-ary non-overlapping codes. 265-281 - Maryam Bajalan, Edgar Martínez-Moro:
Polycyclic codes over serial rings and their annihilator CSS construction. 283-306 - Giuseppe Filippone:
Erratum. 307-309
Volume 17, Number 2, March 2025
- Gustavo Banegas, Ricardo Villanueva-Polanco:
On recovering block cipher secret keys in the cold boot attack setting. 311-335 - Tarun Yadav, Manoj Kumar, Amit Kumar, Saibal K. Pal:
A practical-quantum differential attack on block ciphers. 337-357 - Kyungbae Jang, Anubhab Baksi, Jakub Breier, Hwajeong Seo, Anupam Chattopadhyay:
Quantum Implementation and Analysis of Default. 359-375 - Xing Lin:
A new repair-efficient piggybacking design for systematic nodes. 377-396 - Yang Li, Shixin Zhu, Edgar Martínez-Moro:
On general self-orthogonal matrix-product codes associated with Toeplitz matrices. 397-420 - Yaqi Chen, Zhiqiang Cheng, Hao Chen:
Goppa type sum-rank codes. 421-431 - Wajid M. Shaikh, Rupali S. Jain, B. Surendranath Reddy, Bhagyashri S. Patil:
Construction of minimal binary linear codes with dimension n+3. 433-452 - Zhiru Chen, Vladimir Edemskiy, Chenhuang Wu:
Binary sequences with ideal and small arithmetic correlations. 453-464 - Said Eddahmani, Sihem Mesnager:
Determination of cryptographic tables and properties related to the revised boomerang and its application to a fundamental S-box. 465-492 - Animesh Roy, Dibyendu Roy, Pantelimon Stanica:
On combining Arbiter based PUFs. 493-510 - Saumya Shah, Amit Sharma:
Self-dual skew-codes of odd lengths over $\mathbb {Z}_4+u\mathbb {Z}_4$. 511-523 - Akshay Ankush Yadav, Harshdeep Singh, Indivar Gupta:
A note on QM equivalence of known permutation polynomials. 525-540 - Nikolay Kolomeec, Ivan Sutormin, Denis Bykov, Matvey Panferov, Tatyana Bonich:
On additive differential probabilities of the composition of bitwise exclusive-or and a bit rotation. 541-570
Volume 17, Number 3, May 2025
- Vladimir Kolesnikov, Stanislav Peceny, Ni Trieu, Xiao Wang:
Fast ORAM with server-aided preprocessing and pragmatic privacy-efficiency trade-off. 571-596 - Dor Israeli, Alon Noy, Yehuda Afek, Anat Bremler-Barr:
Localhost detour from public to private networks: Vulnerabilities and mitigations. 597-620 - Madhurima Mukhopadhyay, Palash Sarkar:
Pseudo-random walk on ideals: Practical speed-up in relation collection for class group computation. 621-641 - Shlomi Dolev, Avraam Yagudaev, Moti Yung:
HBSS: (Simple) hash-based stateless signatures - hash all the way to the rescue! 643-660 - Maryam Bajalan, Edgar Martínez-Moro:
Correction to: Polycyclic codes over serial rings and their annihilator CSS construction. 661-664
Volume 17, Number 4, July 2025
- Kirpa Garg, Sartaj Ul Hasan, Constanza Riera, Pantelimon Stanica:
The second-order zero differential spectra of some functions over finite fields. 665-694 - Ferruh Özbudak, Paolo Santonastaso, Ferdinando Zullo:
Using multi-orbit cyclic subspace codes for constructing optical orthogonal codes. 695-708 - Sachin Pathak, Rishi Raj, Dipendu Maity:
Skew negacyclic codes of length 4ps over $\mathbb {F}_{p^m} + u\mathbb {F}_{p^m}$. 709-740 - Iván Blanco-Chacón, Alberto Pedrouzo-Ulloa, Rahinatou Yuh Njah Nchiwo, Beatriz Barbero-Lucas:
Fast polynomial arithmetic in homomorphic encryption with cyclo-multiquadratic fields. 741-775 - Johannes Grünberger, Arne Winterhof:
Some notes on the pseudorandomness of Legendre symbol and Liouville function. 777-792 - Ming Yu, Xiaoshan Kai:
Negacyclic dually-BCH codes of length qm-1. 793-807 - Piyush Priyanshu, Abhishek Roy, Subhabrata Paul, Sudhan Majhi:
Constructions of non-binary Golay complementary pairs of new lengths. 809-822 - Samuele Andreoli, Lilya Budaghyan, Robert S. Coulter, Alise Haukenes, Nikolay S. Kaleyski, Enrico Piccione:
On a classification of planar functions in characteristic three. 823-853 - Alessandro Budroni, Andrea Natale:
On the sample complexity of linear code equivalence for all code rates. 855-877 - Zhengting Li, Lin Ding, Xinhai Wang, Zheng Wu:
Table-based guess and determine attack and application to SOSEMANUK. 879-905 - Yongfeng Niu, Yu Li, Fagang Li, Lingling Wu:
Several new kinds of (k+1)-dimensional Sidon spaces and cyclic subspace codes. 907-919 - Ruhao Wan, Shixin Zhu:
σ hulls of Goppa codes and related codes over ${\mathbb {F}}_q$. 921-943 - Kanchan Singh, Sheo Kumar Singh:
New constant dimension subspace codes via generalized coset construction. 945-957 - Boran Kim:
Minimal codewords over finite fields derived from certain graphs. 959-976 - Zuling Chang, Qiang Wang, Jie Xue:
An effective approach to enumerate universal cycles for k-permutations. 977-988 - V. N. Potapov:
On the number of relevant variables for discrete functions. 989-998 - Yuxuan Lu, Sihem Mesnager, Nian Li, Lisha Wang, Xiangyong Zeng:
A new class of S-boxes with optimal Feistel boomerang uniformity. 999-1011 - Xiangdi Zeng, Xiangrui Meng, Jian Gao, Fang-Wei Fu:
Complete weight enumerators of few-weight linear codes. 1013-1050 - Tran Thi Luong:
Improving block cipher resilience with dynamically generated XOR matrices using the Fisher-Yates shuffle method. 1051-1074 - Alireza Abdollahi, Javad Bagherian, Fatemeh Jafari, Maryam Khatami, Farzad Parvaresh, Reza Sobhani:
Upper bounds on the size of permutation codes with a Hamming distance of five. 1075-1091 - Lei Sun, Zexia Shi, Jian Liu, Fang-Wei Fu:
Generic constructions of plateaued idempotents with high algebraic degree. 1093-1107 - Tapas Chatterjee, Ayantika Laha:
A note on cyclic MDS and non-MDS matrices. 1109-1124 - Jong Hyok Choe:
On the solutions of Xq2+aXq+bX=c over $ {\mathbb {F}}_{2^{n}} $. 1125-1147 - Xue Jia, Qin Yue:
Generator polynomials of cyclic expurgated or extended Goppa codes with odd characteristic. 1149-1172 - Kaimin Cheng, Shuhong Gao:
On binomial Weil sums and an application. 1173-1190
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-09-26 23:40 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:
