51 results about "IMG" patented technology

A combination of an infrequently-called tiny multiplication unit and a “differential” unit that quickly computes T (n+1) basing on known T n. The schedule (how often the multiplication unit is called) can be considered as a parameter of the algorithm. The proposed architecture of the “differential” unit is efficient both in terms of speed (delay) and area (gate count).

In one embodiment, it is proposed a method for encrypting a plaintext M ∈, where is a DDH-hard group of prime order p. The method is executed by an electronic device, and is remarkable in that it comprises:obtaining a public key PK=(, N, g, h, X, H, G) where N is a RSA module, elements g, h are random elements belonging to said group , X=gxhy ∈, where elements x, y are random values from a ring p, and H, G are hash functions;obtaining two random elements r, s, each element belonging to the ring p;determining a vector being (C0, C1, C2)=(M.Xr, gr, hr);determining a proof π that logg(C1)=logh(C2), said proof comprising two components c, t′, with c=H(C0, C1, C2, gs, hs) and t′=s+c.r mod p;delivering a ciphertext C=(C0, C1, C2, π)=(C0, C1, C2, c, t′) ∈3×p2.

Described is a system for mobile proactive secret sharing. The system utilizes a Secret-Share protocol to share, by server Pj, a secret s among a set of servers , such that a degree of polynomials used to share the secret s is d and a shared secret is denoted as [s]. A GenPoly protocol is used to cause the servers in the set of servers to generate l random polynomials of degree D. A Secret-Redistribute protocol is used to redistribute the shared secret [s] to a set of new servers ′. Finally, a Secret-Open protocol is used to open the shared secret [s].

The present invention provides a network coding TCP decoding method and device based on feedback. The method includes: when receiving a TCP data packet sent by the TCP layer, the sending end performs the encoding packet that needs to be sent currently according to the packet loss rate of the current link. The number Sn is updated; according to the feedback information carried in the response message sent by the receiving end received at the current moment, the current number of encoding window locks Ln is determined; if the current number of encoding window locks Ln is not 0, the encoding window is fixed , and the W TCP data packets in the encoding window will be encoded according to the number of packets Perform preset encoding, and encode the encoded packets are sent to the receiver. The present invention can not only generate active compensation according to the network environment, but also make corresponding adjustments based on the feedback to speed up the full rank of the decoding matrix and reduce the decoding waiting time delay.

The invention provides a method for judging the convex figure shape similarity in a digital image. The method comprises the steps of S1, for any two convex figure shapes omega 1 and omega 2 that are subjected to similarity judgment, respectively figuring out the complex plane feature vectors of the two convex figure shapes based on GCT transformation and recording the complex plane feature vectors thereof as F1 and F2; calculating the intensity sequences and the phase sequences thereof and respectively recording the intensity sequences and the phase sequences as M1, S1, M2 and S2; judging the similarity between the phase sequence S1 and the phase sequence S2; calculating according to img file='DDA0000901986470000011.TIF' wi='131' he='65', img file='DDA0000901986470000012.TIF' wi='1938' he='99', and img file='DDA0000901986470000013.TIF' wi='1123' he='98'; when delta is larger than 0.2, judging that the two convex figure shapes are not similar; S3, judging the similarity between the intensity sequence M1 and the intensity sequence M2; calculating according to img file='DDA0000901986470000014.TIF' wi='918' he='94', img file='DDA0000901986470000015.TIF' wi='1907' he='99', and img file='DDA0000901986470000016.TIF' wi='579' he='97'; when eta is larger than 0.2, judging that the two convex figure shapes are not similar; otherwise, judging that the two convex figure shapes are similar. The method is simple to realize and low in time complexity. The identification accuracy of the method is up to more than 90%.

The encoding and decoding of HOA signals using Singular Value Decomposition includes forming (11) based on sound source direction values and an Ambisonics order corresponding ket vectors (|(Ω5))) of spherical harmonics and an encoder mode matrix (Ξ0χs). From the audio input signal (|χ(Ωs))) a singular threshold value (σε) determined. On the encoder mode matrix a Singular Value Decomposition (13) is carried out in order to get related singular values which are compared with the threshold value, leading to a final encoder mode matrix rank (rfine). Based on direction values (Ωι) of loudspeakers and a decoder Ambisonics order (Nι), corresponding ket vectors (IY(Ωι)) and a decoder mode matrix (Ψ0χL) are formed (18). On the decoder mode matrix a Singular Value Decomposition (19) is carried out, providing a final decoder mode matrix rank (r find). From the final encoder and decoder mode matrix ranks a final mode matrix rank is determined, and from this final mode matrix rank and the encoder side Singular Value Decomposition an adjoint pseudo inverse (Ξ+)† of the encoder mode matrix (Ξ0χs) and an Ambisonics ket vector (Ia′s) are calculated. The number of components of the Ambisonics ket vector is reduced (16) according to the final mode matrix rank so as to provide an adapted Ambisonics ket vector (|a′ι). From the adapted Ambisonics ket vector, the output values of the decoder side Singular Value Decomposition and the final mode matrix rank an adjoint decoder mode matrix (Ψ)† is calculated (15), resulting in a ket vector (|y(Ωι)) of output signals for all loudspeakers.

The invention relates to a public key encryption method based on a finite field (shown in the formula in the specification) multiplication group, in particular to a public key encryption method basedon the finite field ( shown in the formula in the specification) multiplication group. wherein p is a prime number, and the formula (1) is shown in the specification, and p is a prime number and is made to be a Mesene number. Finite field isomorphism and polynomial field (img field RE-482803DEST _ PATH _ IMAGE001. TIF) isomorphism and polynomial field (img field RE-637709DEST _ PATH _ IM wherein the structural formula of the polynomial is as shown in the specification, the structural formula of the polynomial is as shown in the specification, and the structural formula of the polynomial is asshown in the specification, wherein the structural formula of the polynomial is as shown in the specification, and the structural formula of the polynomial is as shown in the specification. In the Finite field multiplication group wherein the order of the formula (I) is shown in the specification, the order of the formula (I) is shown in the specification, and the order of the formula (I) is shownin the specification. The order of the formula (II) is shown in the specification. Therefore, the order of the element a of any non-unit element is shown in the specification, wherein the order of the element a of any non-unit element is shown in the specification; the order of the element b of any non-unit element is shown in the specification; The invention discloses a public key cryptosystem.the receiver B discloses a random element a; the primitive polynomial q is used as a system parameter; the k1 is seen as a private key by the random number; A public key g (shown in the specification)is disclosed. An encryption party A generates a random number k2, and the random number k2 is smaller than or equal to 1 and smaller than or equal to 1. carrying out a modular exponentiation operation (shown in the formula in the specification), carrying out a modular exponentiation operation (shown in the formula in the specification), and carrying out a modular exponentiation operation (shown in the formula in the specification), carrying out modular multiplication on the encrypted plaintext m (shown in the formula in the specification), and carrying out modular multiplication on the encrypted plaintext m, The method comprises the following steps that: a decryption party receives a ciphertext, generates a ciphertext according to the ciphertext, and generates the ciphertext according tothe ciphertext. The decryption party receives the ciphertext and generates the ciphertext according to the ciphertext. and decrypting by using the private key k1 to obtain a plaintext m. The method disclosed by the invention can be applied to the aspects of symmetric passwords, public key passwords, digital signatures and the like. The method disclosed by the invention can be applied to the fieldsof the symmetric passwords, the public key passwords, the digital signatures and the like.

The invention discloses a method, system and device for installing a virtual machine operating system. The method comprises the following steps: obtaining a vmlinuz temporary file and an initrd.img temporary file; adding a kickstart configuration file and a configuration script file to an initrd.img temporary file; configuring paths of the vmlinuz temporary file and the initrd.img temporary file to a metadata configuration file of the virtual machine; when the virtual machine is started to enter an installation operation system, configuring a system kernel based on the vmlinuz temporary file in the metadata configuration file of the virtual machine, and configuring corresponding hardware equipment based on the kickstart configuration file and the configuration script file in the initrd.imgtemporary file to complete system installation. Therefore, according to the virtual machine operating system installation mode, a PXE server does not need to be deployed, installation of the virtualmachine operating system can be achieved only through a file configuration mode, and the application range is wide.