5,751 research outputs found
A Novel Latin Square Image Cipher
In this paper, we introduce a symmetric-key Latin square image cipher (LSIC)
for grayscale and color images. Our contributions to the image encryption
community include 1) we develop new Latin square image encryption primitives
including Latin Square Whitening, Latin Square S-box and Latin Square P-box ;
2) we provide a new way of integrating probabilistic encryption in image
encryption by embedding random noise in the least significant image bit-plane;
and 3) we construct LSIC with these Latin square image encryption primitives
all on one keyed Latin square in a new loom-like substitution-permutation
network. Consequently, the proposed LSIC achieve many desired properties of a
secure cipher including a large key space, high key sensitivities, uniformly
distributed ciphertext, excellent confusion and diffusion properties,
semantically secure, and robustness against channel noise. Theoretical analysis
show that the LSIC has good resistance to many attack models including
brute-force attacks, ciphertext-only attacks, known-plaintext attacks and
chosen-plaintext attacks. Experimental analysis under extensive simulation
results using the complete USC-SIPI Miscellaneous image dataset demonstrate
that LSIC outperforms or reach state of the art suggested by many peer
algorithms. All these analysis and results demonstrate that the LSIC is very
suitable for digital image encryption. Finally, we open source the LSIC MATLAB
code under webpage https://sites.google.com/site/tuftsyuewu/source-code.Comment: 26 pages, 17 figures, and 7 table
A new block cipher algorithm that adopts the magic square of the fifth order with messages of different lengths and multi-function in GF(28)
This paper is considered as a development of encryption algorithms based on Magic Square of Order Five. Both GF(P) and GF(28) are used to encode both images and text. Where two different algorithms were used, the first using message length = 10 and the second message length = 14, and an unspecified number of rounds were added and a mask will be used in the even round will use the addition operation and in the odd round will used the multiplication operation so that the text resulting from the first round will be as input text for the next Round, and thus. The speed, complexity, NIST tests and histogram for the first ten rounds were calculated and compared with the results of the previous algorithm before the rounds were made, where the complexity in the first algorithm was = ((256)^ 15)^(r+1)× (256)^10 + or × (256)^25 and the complexity in the second algorithm = ((256)^11)^(r+1) ×(256)^14 + or × (256)^25 where r represents the number of round used
Consequences of the center-of-mass correction in nuclear mean-field models
We study the influence of the scheme for the correction for spurious
center-of-mass motion on the fit of effective interactions for self-consistent
nuclear mean-field calculations. We find that interactions with very simple
center-of-mass correction have significantly larger surface coefficients than
interactions for which the center-of-mass correction was calculated for the
actual many-body state during the fit. The reason for that is that the
effective interaction has to counteract the wrong trends with nucleon number of
all simplified schemes for center-of-mass correction which puts a wrong trend
with mass number into the effective interaction itself. The effect becomes
clearly visible when looking at the deformation energy of largely deformed
systems, e.g. superdeformed states or fission barriers of heavy nuclei.Comment: 12 pages LATeX, needs EPJ style files, 5 eps figures, accepted for
publication in Eur. Phys. J.
The Arena: An indoor mixed reality space
ln this paper, we introduce the Arena, an indoor space for mobile mixed reality interaction. The Arena includes a new user tracking system appropriate for AR/MR applications and a new Too/kit oriented to the augmented and mixed reality applications developer, the MX Too/kit. This too/kit is defined at a somewhat higher abstraction levei, by hiding from the programmer low-level implementation details and facilitating ARJMR object-oriented programming. The system handles, uniformly, video input, video output (for headsets and monitors), sound aurelisation and Multimodal Human-Computer Interaction in ARJMR, including, tangible interfaces, speech recognition and gesture recognition.info:eu-repo/semantics/publishedVersio
Video Manipulation Techniques for the Protection of Privacy in Remote Presence Systems
Systems that give control of a mobile robot to a remote user raise privacy
concerns about what the remote user can see and do through the robot. We aim to
preserve some of that privacy by manipulating the video data that the remote
user sees. Through two user studies, we explore the effectiveness of different
video manipulation techniques at providing different types of privacy. We
simultaneously examine task performance in the presence of privacy protection.
In the first study, participants were asked to watch a video captured by a
robot exploring an office environment and to complete a series of observational
tasks under differing video manipulation conditions. Our results show that
using manipulations of the video stream can lead to fewer privacy violations
for different privacy types. Through a second user study, it was demonstrated
that these privacy-protecting techniques were effective without diminishing the
task performance of the remote user.Comment: 14 pages, 8 figure
NEEXP is Contained in MIP*
We study multiprover interactive proof systems. The power of classical multiprover interactive proof systems, in which the provers do not share entanglement, was characterized in a famous work by Babai, Fortnow, and Lund (Computational Complexity 1991), whose main result was the equality MIP = NEXP. The power of quantum multiprover interactive proof systems, in which the provers are allowed to share entanglement, has proven to be much more difficult to characterize. The best known lower-bound on MIP* is NEXP ⊆ MIP*, due to Ito and Vidick (FOCS 2012). As for upper bounds, MIP* could be as large as RE, the class of recursively enumerable languages.
The main result of this work is the inclusion of NEEXP = NTIME[2^(2poly(n))] ⊆ MIP*. This is an exponential improvement over the prior lower bound and shows that proof systems with entangled provers are at least exponentially more powerful than classical provers. In our protocol the verifier delegates a classical, exponentially large MIP protocol for NEEXP to two entangled provers: the provers obtain their exponentially large questions by measuring their shared state, and use a classical PCP to certify the correctness of their exponentially-long answers. For the soundness of our protocol, it is crucial that each player should not only sample its own question correctly but also avoid performing measurements that would reveal the other player's sampled question. We ensure this by commanding the players to perform a complementary measurement, relying on the Heisenberg uncertainty principle to prevent the forbidden measurements from being performed
- …