Results 11 to 20 of about 3,784 (194)

New Approach for Modifying DES Algorithm by Using Multiple Keys Depend on Heuristic Search Algorithm [PDF]

open access: yesEngineering and Technology Journal, 2013
In this paper, artificial search algorithm(breath algorithm ) are used to design a symmetric key cryptography system based on DES algorithm,the LFSRs and breath algorithm are applied to generate a pseudo-random numbers sequence (PNS) which is used during
Alaa K. Farhan   +3 more
doaj   +1 more source

A Novel Construction of Substitution Box Based on Polynomial Mapped and Finite Field With Image Encryption Application

open access: yesIEEE Access, 2022
In the modern block cipher, the substitution box (S-box) is a nonlinear constituent that plays a substantial role to create the confusion in ciphertext. S-boxes with low value of differential uniformity and high value of nonlinearity are considered more ...
Abid Mahboob   +6 more
doaj   +1 more source

Parabolic Catalan numbers count flagged Schur functions and their appearances as type A Demazure characters (key polynomials) [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2017
Fix an integer partition lambda that has no more than n parts. Let beta be a weakly increasing n-tuple with entries from {1,..,n}. The flagged Schur function indexed by lambda and beta is a polynomial generating function in x_1, .., x_n for certain ...
Robert A. Proctor, Matthew J. Willis
doaj   +1 more source

On Provable White-Box Security in the Strong Incompressibility Model

open access: yesTransactions on Cryptographic Hardware and Embedded Systems, 2023
Incompressibility is a popular security notion for white-box cryptography and captures that a large encryption program cannot be compressed without losing functionality. Fouque, Karpman, Kirchner and Minaud (FKKM) defined strong incompressibility, where
Estuardo Alpirez Bock   +2 more
doaj   +1 more source

Algebraic Attacks on RAIN and AIM Using Equivalent Representations

open access: yesIACR Transactions on Symmetric Cryptology, 2023
Designing novel symmetric-key primitives for advanced protocols like secure multiparty computation (MPC), fully homomorphic encryption (FHE) and zero-knowledge proof systems (ZK), has been an important research topic in recent years.
Fukang Liu   +3 more
doaj   +1 more source

A Degenerate Spatial ARMA Process of External Sources Impinging Upon an Azimuth-Only ULA and the Estimation of Doas and Noise Variances

open access: yesIEEE Access, 2020
Array processing is an interdisciplinary topic of both physics and signal processing. Physical basis of array processing is the orderly-setup of sensors in space that induces regular change of the phase of external sources incident upon sensor array.
Guijin Yao   +3 more
doaj   +1 more source

On algebraic bases of algebras of block-symmetric polynomials on Banach spaces

open access: yesMatematychni Studii, 2012
The paper contains a description of algebraic basis of algebra of block-symmetric polynomials on the l_1-sum of the copies of l_1.
V. V. Kravtsiv, A. V. Zagorodnyuk
openaire   +2 more sources

A relaxed block splitting preconditioner for complex symmetric indefinite linear systems

open access: yesOpen Mathematics, 2018
In this paper, we propose a relaxed block splitting preconditioner for a class of complex symmetric indefinite linear systems to accelerate the convergence rate of the Krylov subspace iteration method and the relaxed preconditioner is much closer to the ...
Huang Yunying, Chen Guoliang
doaj   +1 more source

Analogues of the Newton formulas for the block-symmetric polynomials on $\ell_p(\mathbb{C}^s)$

open access: yesCarpathian Mathematical Publications, 2020
The classical Newton formulas gives recurrent relations between algebraic bases of symmetric polynomials. They are true, of course, for symmetric polynomials on infinite-dimensional sequences Banach space. In this paper we consider block-symmetric polynomials (or MacMahon symmetric polynomials) on Banach spaces $\ell_p(\mathbb{C}^s),$ $1\le p\le \infty.
openaire   +3 more sources

Quantum Max d-Cut via qudit swap operators [PDF]

open access: yesQuantum
Quantum Max Cut (QMC) problem for systems of qubits is an example of a 2-local Hamiltonian problem, and a prominent paradigm in computational complexity theory.
Igor Klep, Tea Štrekelj, Jurij Volčič
doaj   +1 more source

Home - About - Disclaimer - Privacy