The following pages link to Sedat Akleylek (Q1718629):
Displaying 15 items.
- On the construction of \(20 \times 20\) and \(2 4 \times 24\) binary matrices with good implementation properties for lightweight block ciphers and hash functions (Q1718633) (← links)
- On the construction of \(4 \times 4\) lightweight involutory MDS matrices over \(\mathbb{F}_{2^8}\) (Q2080004) (← links)
- Accelerating number theoretic transform in GPU platform for qTESLA scheme (Q2169915) (← links)
- On the arithmetic operations over finite fields of characteristic three with low complexity (Q2349632) (← links)
- A new matrix form to generate all \(3\times 3\) involutory MDS matrices over \(\mathbb{F}_{2^m}\) (Q2414052) (← links)
- On the Efficiency of Polynomial Multiplication for Lattice-Based Cryptography on GPUs Using CUDA (Q2802424) (← links)
- An Efficient Lattice-Based Signature Scheme with Provably Secure Instantiation (Q2814694) (← links)
- Polynomial Multiplication over Binary Fields Using Charlier Polynomial Representation with Low Space Complexity (Q3058727) (← links)
- Faster Montgomery Modular Multiplication without Pre-computational Phase For Some Classes of Finite Fields (Q4932751) (← links)
- A Novel Niederreiter-like cryptosystem based on the (<i>u</i>|<i>u</i> + <i>υ</i>)-construction codes (Q5021116) (← links)
- On the Effect of <i>k</i> Values and Distance Metrics in KNN Algorithm for Android Malware Detection (Q5072087) (← links)
- Efficient Nyberg-Rueppel type of NTRU digital signature algorithm (Q5101024) (← links)
- On the Polynomial Multiplication in Chebyshev Form (Q5277634) (← links)
- Modified Redundant Representation for Designing Arithmetic Circuits with Small Complexity (Q5277654) (← links)
- A novel 3-pass identification scheme and signature scheme based on multivariate quadratic polynomials (Q5742929) (← links)
