نتایج جستجو برای: chinese remainder theorem crt

تعداد نتایج: 301262  

2016
Rosemary Koikara Kee-Young Yoo

(t, n)-threshold secret sharing was first introduced by Shamir and Blakley separately in 1979. Apart from this, there are threshold secret sharing schemes which use the Chinese Remainder Theorem (CRT). The above mentioned are three of the most extensively researched tools used for designing a (t, n)-threshold secret sharing scheme. In this paper we propose a scheme for Multilevel Threshold Secr...

Journal: :International Journal of Computing 2014

Journal: :IEEE Transactions on Signal Processing 2014

Journal: :Advances in Mathematics 2021

We prove the equidistribution of subsets (R/Z)n defined by fractional parts (Z/qZ)n that are constructed using Chinese Remainder Theorem.

Journal: :CoRR 2017
Hanshen Xiao Yufeng Huang Yu Ye Guoqiang Xiao

Chinese Remainder Theorem (CRT) has been widely studied with its applications in frequency estimation, phase unwrapping, coding theory and distributed data storage. Since traditional CRT is greatly sensitive to the errors in residues due to noises, the problem of robustly reconstructing integers via the erroneous residues has been intensively studied in the literature. In order to robustly reco...

Journal: :Jurnal Teknologi Informasi dan Ilmu Komputer 2023

<p class="Abstrak">Kemudahan untuk mengakses dan berbagi media digital saat ini menimbulkan kekhawatiran mengenai pelanggaran hak cipta atau pembajakan. Sehingga perlu memberikan identitas kepada setiap agar tidak mudah dibajak diklaim oleh pihak-pihak yang bertanggung jawab. Salah satu cara pada suatu tanpa mengurangi kualitas dari medianya sendiri yaitu dengan menggunakan watermarking. ...

Journal: :IEEE Transactions on Dependable and Secure Computing 2021

Existing security and identity-based vehicular communication protocols used in Vehicular Ad-hoc Networks (VANETs) to achieve conditional privacy-preserving mostly rely on an ideal hardware device called tamper-proof (TPD) equipped vehicles. Achieving fast authentication during the message verification process is usually challenging such strategies further they suffer performance constraints fro...

2005
OLIVER KNILL

Using an adaptation of Qin Jiushao’s method from the 13th century, it is possible to prove that a system of linear modular equations ai1xi + · · · + ainxn = ~bi mod ~ mi, i = 1, . . . , n has integer solutions if mi > 1 are pairwise relatively prime and in each row, at least one matrix element aij is relatively prime to mi. The Chinese remainder theorem is the special case, where A has only one...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید