“Non-Malleable Randomness Encoder” (NMRE) was introduced by Kanukurthi et al. (2018) as a useful cryptographic primitive helpful in the construction of non-malleable codes. To the best of our knowledge, their construction is not known to be quantum secure. We provide a construction of a first rate-$1/2$, 2-split, quantum secure NMRE and use this in a black-box manner, to construct the following: 1) rate$1/11$, 3-split, quantum non-malleable code; 2) rate$1/3$, 3-split, quantum secure non-malleable code; and 3) rate$1/5$, 2-split, average case quantum secure non-malleable code.

One-way state generators (OWSG) [1] are natural quantum analogs to classical one-way functions. We consider statistically-verifiable OWSGs (sv-OWSG), which are potentially weaker objects than OWSGs. We show that$O\left(\frac{n}{\log (n)}\right)$-copy sv-OWSGs ($n$represents the input length) are equivalent to$poly (n)$-copy sv-OWSGs and to quantum commitments. Since known results show that$o\left(\frac{n}{\log (n)}\right)$-copy OWSGs cannot imply commitments [2], this shows that$O\left(\frac{n}{\log(n)}\right)$-copy sv-OWSGs are the weakest OWSGs from which we can get commitments (and hence much of quantum cryptography). Our construction follows along the lines of Hastad, Impagliazzo, Levin and Luby [3], who obtained classical pseudorandom generators (PRG) from classical one-way functions (OWF), however with crucial modifications. Our construction, when applied to the classical case, provides an alternative to the construction provided by [3] to obtain a classical mildly non-uniform PRG from any classical OWF. Since we do not argue conditioned on the output$f(x)$, our construction and analysis is arguably simpler and may be of independent interest. For converting a mildly non-uniform PRG to a uniform PRG, we can use the same construction as [3].