← 返回期刊列表
Review Cycle Records
DESIGNS CODES AND CRYPTOGRAPHY
数据更新 2026-07-16 · 完整周期 10 篇 · 日期来源可逐条复核
DESIGNS CODES AND CRYPTOGRAPHY已收录10篇完整论文周期样本，平均审稿418.3 天，中位审稿320.5 天。2025中科院3区，非OA，2025发文量197。页面含论文收到日期、录用日期、PDF、DOI和出版社网页溯源入口。
Latest Papers
最新发表论文审稿周期
审稿天数=录用日期-收到日期；保留 PDF/DOI/网页源链接
510
天
1,035
天
Hierarchical identity-based encryption with receiver selective opening security in the multi-challenge setting
作者Zi-Yuan Liu; Masahiro Mambo; Raylin Tso; Yi-Fan Tseng
作者单位1. Department of Information Management, National Central University, Taoyuan, Taiwan; 2. Graduate School of Natural Science and Technology, Kanazawa University, Kanazawa, Japan; 3. Institute of Science and Engineering, Kanazawa University, Kanazawa, Japan; 4. Department of Computer Science, National Chengchi University, Taipei, Taiwan
239
天
174
天
On the reducibility of minihypers
作者Ivan Landjev; Assia Rousseva; Leo Storme
作者单位1. Institute of Mathematics and Informatics, Bulgarian Academy of Sciences, Sofia, Bulgaria; 2. Faculty of Mathematics and Informatics, Sofia University, Sofia, Bulgaria; 3. Department of Mathematics: Analysis, Logic and Discrete Mathematics, Ghent University, Ghent, Belgium
305
天
The existence and structure of universal partial cycles
作者Dylan Fillmore; Bennet Goeckner; Rachel Kirsch; Kirin Martin; Daniel McGinnis
作者单位1. SUSTech International Center for Mathematics, Southern University of Science and Technology, Shenzhen, China; 2. Department of Mathematics, University of San Diego, San Diego, USA; 3. Department of Mathematical Sciences, George Mason University, George Mason, USA; 4. Department of Mathematics, Iowa State University, Ames, USA; 5. Department of Mathematics, Princeton University, Princeton, USA
336
天
375
天
An improved automatic framework for searching for differential-linear distinguishers with applications to SPN and Feistel block ciphers
作者Yanyan Zhou; Lin Jiao; Senpeng Wang; Yunong Wu; Bin Hu; Tairong Shi; Kai Zhang
作者单位1. College of Computer and Information Engineering, Henan Normal University, Xinxiang, China; 2. Key Laboratory of Artificial Intelligence and Personalized Learning in Education of Henan Province, Xinxiang, China; 3. State Key Laboratory of Cryptology, Beijing, China; 4. PLA Information Engineering University, Zhengzhou, China
695
天
246
天
268
天
Efficient universal cycle constructions for k -permutations via concatenation trees
作者Lingyu Diao; Zuling Chang; Shujie Wang
作者单位1. School of Mathematics and Statistics, Zhengzhou University, Zhengzhou, China; 2. School of Cyber Science and Engineering, Zhengzhou University, Zhengzhou, China