10,685 research outputs found

    Dynamic S-BOX using Chaotic Map for VPN Data Security

    Full text link
    A dynamic SBox using a chaotic map is a cryptography technique that changes the SBox during encryption based on iterations of a chaotic map, adding an extra layer of confusion and security to symmetric encryption algorithms like AES. The chaotic map introduces unpredictability, non-linearity, and key dependency, enhancing the overall security of the encryption process. The existing work on dynamic SBox using chaotic maps lacks standardized guidelines and extensive security analysis, leaving potential vulnerabilities and performance concerns unaddressed. Key management and the sensitivity of chaotic maps to initial conditions are challenges that need careful consideration. The main objective of using a dynamic SBox with a chaotic map in cryptography systems is to enhance the security and robustness of symmetric encryption algorithms. The method of dynamic SBox using a chaotic map involves initializing the SBox, selecting a chaotic map, iterating the map to generate chaotic values, and updating the SBox based on these values during the encryption process to enhance security and resist cryptanalytic attacks. This article proposes a novel chaotic map that can be utilized to create a fresh, lively SBox. The performance assessment of the suggested S resilience Box against various attacks involves metrics such as nonlinearity (NL), strict avalanche criterion (SAC), bit independence criterion (BIC), linear approximation probability (LP), and differential approximation probability (DP). These metrics help gauge the Box ability to handle and respond to different attack scenarios. Assess the cryptography strength of the proposed S-Box for usage in practical security applications, it is compared to other recently developed SBoxes. The comparative research shows that the suggested SBox has the potential to be an important advancement in the field of data security.Comment: 11 Page

    Current implementation of advance encryption standard (AES) S-Box

    Get PDF
    Although the attack on cryptosystem is still not severe, the development of the scheme is stillongoing especially for the design of S-Box. Two main approach has beenused, which areheuristic method and algebraic method. Algebraic method as in current AES implementationhas been proven to be the most secure S-Box design to date. This review paper willconcentrate on two kinds of method of constructing AES S-Box, which are algebraic approachand heuristic approach. The objective is to review a method of constructing S-Box, which arecomparable or close to the original construction of AES S-Box especially for the heuristicapproach. Finally, all the listed S-Boxes from these two methods will be compared in terms oftheir security performance which is nonlinearity and differential uniformity of the S-Box. Thefinding may offer the potential approach to develop a new S-Box that is better than theoriginal one.Keywords: block cipher; AES; S-Bo

    Near-optimal Bootstrapping of Hitting Sets for Algebraic Models

    Full text link
    The classical lemma of Ore-DeMillo-Lipton-Schwartz-Zippel [Ore22,DL78,Zip79,Sch80] states that any nonzero polynomial f(x1,,xn)f(x_1,\ldots, x_n) of degree at most ss will evaluate to a nonzero value at some point on a grid SnFnS^n \subseteq \mathbb{F}^n with S>s|S| > s. Thus, there is an explicit hitting set for all nn-variate degree ss, size ss algebraic circuits of size (s+1)n(s+1)^n. In this paper, we prove the following results: - Let ϵ>0\epsilon > 0 be a constant. For a sufficiently large constant nn and all s>ns > n, if we have an explicit hitting set of size (s+1)nϵ(s+1)^{n-\epsilon} for the class of nn-variate degree ss polynomials that are computable by algebraic circuits of size ss, then for all ss, we have an explicit hitting set of size sexpexp(O(logs))s^{\exp \circ \exp (O(\log^\ast s))} for ss-variate circuits of degree ss and size ss. That is, if we can obtain a barely non-trivial exponent compared to the trivial (s+1)n(s+1)^{n} sized hitting set even for constant variate circuits, we can get an almost complete derandomization of PIT. - The above result holds when "circuits" are replaced by "formulas" or "algebraic branching programs". This extends a recent surprising result of Agrawal, Ghosh and Saxena [AGS18] who proved the same conclusion for the class of algebraic circuits, if the hypothesis provided a hitting set of size at most (sn0.5δ)(s^{n^{0.5 - \delta}}) (where δ>0\delta>0 is any constant). Hence, our work significantly weakens the hypothesis of Agrawal, Ghosh and Saxena to only require a slightly non-trivial saving over the trivial hitting set, and also presents the first such result for algebraic branching programs and formulas.Comment: The main result has been strengthened significantly, compared to the older version of the paper. Additionally, the stronger theorem now holds even for subclasses of algebraic circuits, such as algebraic formulas and algebraic branching program
    corecore