|
|
|
|
|
Egor Shiriaev, Nikolay Kucherov, Mikhail Babenko, Vladislav Lutsenko and Safwat Al-Galda
In this paper, a study is carried out related to improving the reliability and fault tolerance of Fog Computing systems. This work is a continuation of previous studies. In the past, we have developed a method of fast operation for determining the sign o...
ver más
|
|
|
|
|
|
|
|
|
|
|
Jiajian Tang, Zhenfu Cao, Jiachen Shen and Xiaolei Dong
With the development of privacy-preserving techniques, the increasing demand for secure multiparty computation (MPC) of mobile devices has become a significant challenge. Unfortunately, it is inapplicable for mobile devices to implement the existing secu...
ver más
|
|
|
|
|
|
|
|
|
|
|
Mikhail Babenko, Anton Nazarov, Maxim Deryabin, Nikolay Kucherov, Andrei Tchernykh, Nguyen Viet Hung, Arutyun Avetisyan and Victor Toporkov
Error detection and correction codes based on redundant residue number systems are powerful tools to control and correct arithmetic processing and data transmission errors. Decoding the magnitude and location of a multiple error is a complex computationa...
ver más
|
|
|
|
|
|
|
|
|
|
|
Nikolay Chervyakov, Pavel Lyakhov, Mikhail Babenko, Irina Lavrinenko, Maxim Deryabin, Anton Lavrinenko, Anton Nazarov, Maria Valueva, Alexander Voznesensky and Dmitry Kaplun
The residue number system (RNS) is widely used for data processing. However, division in the RNS is a rather complicated arithmetic operation, since it requires expensive and complex operators at each iteration, which requires a lot of hardware and time....
ver más
|
|
|
|
|
|
|
|
|
|
|
Yuan Ping, Baocang Wang, Shengli Tian, Jingxian Zhou and Hui Ma
By introducing an easy knapsack-type problem, a probabilistic knapsack-type public key cryptosystem (PKCHD) is proposed. It uses a Chinese remainder theorem to disguise the easy knapsack sequence. Thence, to recover the trapdoor information, the implicit...
ver más
|
|
|
|
|
|
|
|
|
|
|
J. L. Divya Shivani and Ranjan K. Senapati
This paper presents a DCT-based (DCT: discrete cosine transform) listless set partitioning in hierarchical trees (SPIHT) digital watermarking technique that is robust against several common attacks such as cropping, filtering, sharpening, noise, inversio...
ver más
|
|
|
|
|
|
|
|
|
|
|
J. L. Divya Shivani and Ranjan K. Senapati
This paper presents a DCT-based (DCT: discrete cosine transform) listless set partitioning in hierarchical trees (SPIHT) digital watermarking technique that is robust against several common attacks such as cropping, filtering, sharpening, noise, inversio...
ver más
|
|
|
|
|
|
|
|
|
|
|
????????? ???????? ?????
Pág. 5 - 14
The subject matter of the study is the encryption of information in cloud data computation and storage. Cloud technologies enable reducing the cost of IT infrastructure significantly and responding to changes in computing needs flexibly. In this case, th...
ver más
|
|
|
|
|
|
|
|
|
|
|
Anjaneyulu Endurthi,Oinam B. Chanu,Appala N. Tentu,V. Ch. Venkaiah
Pág. 15 - 24
Three secret sharing schemes that use the Mignotte?ssequence and two secret sharing schemes that use the Asmuth-Bloom sequence are proposed in this paper. All these five secret sharing schemes are based on Chinese Remainder Theorem (CRT) [8]. The first s...
ver más
|
|
|
|
|
|