| no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
| 1 |
A bit-vector differential model for the modular addition by a constant and its applications to differential and impossible-differential cryptanalysis
|
Azimi, Seyyed Arash
|
|
|
90 |
8 |
p. 1797-1855
|
article
|
| 2 |
A complete characterization of D0∩M# and a general framework for specifying bent functions in C outside M#
|
Kudin, Sadmir
|
|
|
90 |
8 |
p. 1783-1796
|
article
|
| 3 |
Adventures in crypto dark matter: attacks, fixes and analysis for weak pseudorandom functions
|
Cheon, Jung Hee
|
|
|
90 |
8 |
p. 1735-1760
|
article
|
| 4 |
A non-interactive (t, n)-publicly verifiable multi-secret sharing scheme
|
Mashahdi, Samaneh
|
|
|
90 |
8 |
p. 1761-1782
|
article
|
| 5 |
Geometric orthogonal codes and geometrical difference packings
|
Wang, Lidong
|
|
|
90 |
8 |
p. 1857-1879
|
article
|
| 6 |
Linear complexity over Fq and 2-adic complexity of a class of binary generalized cyclotomic sequences with good autocorrelation
|
Wang, Yan
|
|
|
90 |
8 |
p. 1695-1712
|
article
|
| 7 |
MDS and near-MDS codes via twisted Reed–Solomon codes
|
Sui, Junzhen
|
|
|
90 |
8 |
p. 1937-1958
|
article
|
| 8 |
On the number of q-ary quasi-perfect codes with covering radius 2
|
Romanov, Alexander M.
|
|
|
90 |
8 |
p. 1713-1719
|
article
|
| 9 |
Strongly regular configurations
|
Abreu, Marién
|
|
|
90 |
8 |
p. 1881-1897
|
article
|
| 10 |
The Modular Subset-Sum Problem and the size of deletion correcting codes
|
Bibak, Khodakhast
|
|
|
90 |
8 |
p. 1721-1734
|
article
|
| 11 |
Vandermonde meets Regev: public key encryption schemes based on partial Vandermonde problems
|
Boudgoust, Katharina
|
|
|
90 |
8 |
p. 1899-1936
|
article
|
Journal description