A new high-speed residue-to-binary converter for five bit moduli based on the Chinese Remainder Theorem is presented. The orthogonal projections are computed by mapping using five-variable logic functions. The sum of projections is calculated using the Wallace tree. The output carry-save representation is partitioned into four segments in such a way that the sum of the numbers represented by th...

In this paper, we derive a nonlinear Picone identity to the pseudo p-Laplace operator, which contains some known Picone identities and removes a condition used in many previous papers. Some applications are given including a Liouville type theorem to the singular pseudo p-Laplace system, a Sturmian comparison principle to the pseudo p-Laplace equation, a new Hardy type inequality with weight an...

In this paper‎, ‎we prove a dichotomy theorem for remainders in‎ ‎compactifications of paratopological groups‎: ‎every remainder of a ‎paratopological group $G$ is either Lindel"{o}f and meager or‎ ‎Baire‎. Furthermore, ‎we give a negative answer to a question posed in [D‎. ‎Basile and A‎. ‎Bella‎, ‎About remainders in compactifications of homogeneous spaces‎, ‎Comment‎. ‎Math‎. ‎Univ‎. ‎Caroli...

This study aims to describe students’ mistakes in solving number theory’s problem. In this study, error analysis, especially on the topic of Diophantine equations and Chinese remainder theorem. type research is qualitative research. The subjects were 46 students mathematics education at Sanata Dharma University. data collection technique used a test. analyzed determine errors doing theory probl...

We consider the problem of generating hard instances for the Satisfying Assignment Search Problem (in short, SAT). It is not known whether SAT is difficult on average, while it has been believed that the Factorization Problem (in short, FACT) is hard on average. Thus, one can expect to generate hard-on-average instances by using a reduction from FACT to SAT. Although the asymptotically best red...

Applying security to the transmitted medical images is important to protect the privacy of patients. Secure transmission requires cryptography, and watermarking to achieve confidentiality, and data integrity. Improving cryptography part needs to use an encryption algorithm that stands for a long time against different attacks. The proposed method is based on number theory and uses Chinese remai...

We consider the problem of generating hard instances for the Satisfying Assignment Search Problem (in short, SAT). It is not known whether SAT is di cult on average, while it has been believed that the Factorization Problem (in short, FACT) is hard on average. Thus, one can expect to generate hard-on-average instances by using a reduction from FACT to SAT. Although the asymptotically best reduc...

Secret sharing is an efficient method for transmitting the image securely. This paper proposes an efficient secret sharing scheme for secret image. The protocol allows each participant to share a secret gray image with the rest of participants. In our scheme, a secret digital image is divided into n pieces, which are further distributed into n participants. The secret digital image can be recon...

In recent times, sketch based techniques are emerging as useful data stream computation techniques towards processing massive data. In many applications, finding heavy hitters and heavy changers is essential and this task demands reversibility property of sketches. Continuing the trend of arriving at newer reversible sketch, this paper presents a scheme based on Chinese Remainder Theorem. The s...

With the rapid development of MANET, secure and practical authentication is becoming increasingly important. The existing works perform the research from two aspects, i.e., (a)secure key division and distributed storage, (b)secure distributed authentication. But there still exist several unsolved problems. Specifically, it may suffer from cheating problems and fault authentication attack, which...