China
Africa
Explore chapters and articles related to this topic
*Theoretical Constructions of Symmetric-Key Primitives
Published in Jonathan Katz, Yehuda Lindell, Introduction to Modern Cryptography, 2020
We next show how pseudorandom permutations and strong pseudorandom permutations can be constructed from any pseudorandom function. Recall from Section 3.5.1 that a pseudorandom permutation is a pseudorandom function that is also efficiently invertible, while a strong pseudorandom permutation is additionally hard to distinguish from a random permutation even by an adversary given oracle access to both the permutation and its inverse.
Efficient Multi-Replica Cloud Data Integrity Checking Method Based on Enhanced PRF
Published in IETE Journal of Research, 2022
Anju Susan George, A. Shajin Nargunam
Setup: This algorithm generates the confidential parameter cp and the public parameter pu by selecting a security parameter ա. A signing key pair (scp, spu) is first selected by the user and then takes k1, k2∈ Zp as two random elements which can be used for replica generation and block tag computation respectively. Also, N number of arbitrary components y1, … … … ., yN are selected by the user. Now the user calculates: σ = ց1k2∈ Ǥ1. A pseudorandom permutation ¢key() and a pseudorandom function Ýkey() are determined by the user. The confidential parameter cp is given as (k2, scp) and the public parameter pu is given as (σ, spu, y1, … … , yN).
Enhancing the Time Performance of Encrypting and Decrypting Large Tabular Data
Published in Applied Artificial Intelligence, 2021
Nguyen Thon Da, Ho Trung Thanh
Recently, several researchers have proposed various methods to solve the problems regarding data security. (Hazra et al. 2015) suggested a pseudorandom permutation method. They proposed an attached algorithm that produces a block cypher using the mentioned procedure.