44 citations · 96 across the 5 of their papers we have counts for
Showing cs.CRShow all
2 papers · 1 filter
cs.CR2016★ 1 cited
Secure cloud computations: Description of (fully)homomorphic ciphers within the P-adic model of encryption
Andrei Khrennikov, Ekaterina Yurova
In this paper we consider the description of homomorphic and fully homomorphic ciphers in the -adic model of encryption. This model describes a wide class of ciphers, but certai…
cs.CR2011★ 44 cited
T-functions revisited: New criteria for bijectivity/transitivity
Vladimir Anashin, Andrei Khrennikov, Ekaterina Yurova
The paper presents new criteria for bijectivity/transitivity of T-functions and fast knapsack-like algorithm of evaluation of a T-function. Our approach is based on non-Archimedean…