23 results about "Bitmessage" patented technology

The invention discloses a covert communication system based on a generative diffusion model, and belongs to the technical field of covert communication. In order to solve the problems of insufficient concealment and poor anti-noise performance in the prior art, hidden transmission and reliable recovery of information are realized by constructing a diffusion generation and classification discrimination module. The sending end carries out noise addition and shaping on the original bit waveform by using a forward diffusion process to form a noise-like hidden signal; and a receiving end recovers a signal structure through a reverse denoising process, and accurately judges bit information through a classifier. According to the method, a Gaussian approximation hidden waveform library is constructed by adopting a signal pair training model which is consistent in statistics but distinguishable in structure, and random sampling mapping and boundary smooth splicing are combined, so that transmission signals are difficult to distinguish from noise in a frequency domain and a feature space; therefore, the avoidance capability, the anti-interference robustness and the information recovery accuracy under the low signal-to-noise ratio of the detection means are remarkably improved.

The invention relates to a self-adaptive information negotiation method applicable to a continuous variable quantum key distribution system, which comprises the following steps of: estimating an optimal code rate that an LDPC (Low Density Parity Check) code should reach under a current quantum channel, converting an initial code rate into the optimal code rate by a receiver, and obtaining a low-reliability bit number l which needs to be disclosed in conversion calculation, the method comprises the following steps of: decoding an LLR (Local Library Ratio) by using Bob, sending the LLR to Alice through a classic channel in combination with an encryption technology, sorting absolute values of the LLR by Alice in a decoding iteration process, selecting l bit positions with low reliability, sending the bit positions to Bob, determining a bit value by Bob according to the bit positions with low reliability sent by Alice, and feeding back and sending the bit value to Alice, and correcting the LLR value by Alice according to bit information sent by Bob. According to the method disclosed by the invention, the code rate of the LDPC code can be flexibly adjusted along with the change of the state of the time-varying channel, and the negotiation efficiency is improved, so that the key rate of the system is improved. The method is excellent in performance in a time-varying channel environment, negotiation efficiency under a low signal-to-noise ratio condition can be remarkably improved, and an efficient and reliable information negotiation scheme is provided for practical application of a quantum secret communication system.

A communication method and device are applied to the technical field of communication. In the method, a terminal device sends a first signal obtained by modulating a first sequence and performing resource mapping on the modulated signal, the first sequence is obtained by modifying a Gold sequence bearing a source bit, and the bearing of the source bit by the Gold sequence is realized by respectively bearing part of bits in the source bit by two m sequences in the Gold sequence. In the method, the Gold sequence can bear more information bits, so that bit information with larger data volume can be transmitted.

An error correction code (ECC) system of a data storage device utilizes a joint decoding scheme to correct errors in a codeword when the codeword has failed a decoding process using a first decoding scheme. The ECC system uses information derived from the second decoding scheme to generate soft bit information, or reliability information, associated with a portion of the failed codeword. The soft bit information derived from the second decoding scheme is provided to the first decoding scheme when the first decoding scheme attempts to correct or decode the failed codeword.

The invention discloses a continuous variable quantum secret sharing method based on a state distinguishing detector. The method comprises the following steps: a user generates a binary key sequence; a QPSK state signal is generated; sequentially coupling the QPSK state signals through an asymmetric beam splitter; the Dealer uses the SDD to estimate the received signal; repeating the steps, and extracting an original combined key; obtaining an original key of each user based on a key sequence combination principle; and calculating a key rate, and extracting a key to complete encryption message decoding. According to the method, quantum state distinguishing is completed through a state distinguishing detector (SDD), and the SDD is allowed to directly determine bit information directly transmitted by different users by identifying mixed state categories, so that each user does not need to declare and discard respective original key subsets, a mapping rule is directly restored, key loss is reduced, and the user experience is improved. And the key rate performance of the SDD-CVQSS protocol is improved. In addition, compared with the traditional CVQSS, the SDD-CVQSS shows obvious advantages in key performance indexes of the key rate and the maximum transmission distance.

Embodiments of the present disclosure provide a communication method, an electronic device, and a computer program product. The communication method comprises: a sending end acquires mapping relationships between different data streams of a communication system and a power allocation matrix obtained by fusion and dimensionality reduction; the sending end superimposes, on the basis of the mapping relationships, pilot data and original data to obtain aliased data; and the sending end acquires, on the basis of the aliased data, a signal to be transmitted, and sends said signal and said power allocation matrix to a receiving end, so that the receiving end acquires bit information of the original data.

Methods and apparatuses for performing a set of transmissions using polar coding with retransmissions using cross-block check blocks are described. A first transmission is performed at a first code rate, the first transmission including a first plurality of information blocks, each information block having a plurality of information bits. A second transmission is performed at a second code rate that is lower than the first code rate. The second transmission includes a set of cross-block check blocks generated using information bits selected from across a second plurality of information blocks. Each of the second plurality of information blocks is a subset of the information bits of a respective one of the first plurality of information blocks, the information bits of each subset being selected from least reliable bit channels of the respective one of the plurality of information blocks.

The present application relates to the field of GNSS satellite communication, and particularly relates to a data storage method, system, storage medium and electronic device.The method comprises the following steps: step 1, based on the Viterbi algorithm, the soft bit information is calculated to obtain the branch metric of each soft bit information, and the soft bit information is the information data after baseband processing; step 2, based on the branch metric, the surviving path is obtained; step 3, the index relationship between the surviving path and the current storage address corresponding to the surviving path is established; step 4, based on the index relationship, the surviving path is updated to the physical position of the current storage address. The method can effectively solve the problem that a large amount of resources are occupied due to separate storage of the calculation result in the prior art by replacing the position of the storage address, in addition, the calculation result can also be saved without affecting the data of other positions by replacing the physical position, so that the integrity of the data is ensured.

According to the communication method, a receiving end device generates a bit sequence based on A information bits and the number nPC of PC bits, the bit sequence comprises N bits, the information bits and the PC bits are located at A + nPC positions with the highest sequence reliability in the bit sequence, and the PC positions where the PC bits are placed meet a first condition and a second condition, the first condition is that the minimum row weight of A positions where A information bits are located is not less than the minimum row weight of A positions with the highest sequence reliability in the bit sequence, and the second condition is that the kth high position number in nPC position numbers in the bit sequence is not less than the kth high position number in the set S3, the set S3 comprises nPC positions with the lowest reliability in A + nPC positions with the highest sequence reliability; and performing polarization coding on the bit sequence to obtain a code word sequence. According to the method, a PC bit placement mode for determining the requirement of a correct decoding path based on PC bits is provided.

Disclosed in the present application are a wake-up information transmission method and a communication apparatus. The method comprises: receiving a first signal, wherein the first signal is modulated on the basis of a first sequence, the first sequence carries wake-up information and / or bit information, and the bit information is part of the wake-up information. Using the method can improve reliability and resist fading.

The invention discloses a prime power RSA modulus decomposition method and system, a medium and equipment, and the method comprises the following steps: obtaining a value through the information of a part of high bits leaked by a private key, a prime power RSA modulus and a small public key index; recovering partial information of the prime number by using the obtained information, specifically comprising the following steps: constructing a modular equation to solve the value of the prime number; the method comprises the following steps: constructing two functions, and approaching a prime number in a binary search mode by using a size relationship of function values to obtain high bit information of a prime number part; constructing a first-order modular equation by using part of information of the recovered prime number, and recovering a complete prime number in combination with a Appersmith algorithm; and decomposing by using prime numbers and moduli. According to the method, less private key bit information is utilized, and modulus decomposition is completed, so that security analysis of the prime power RSA cryptographic algorithm is realized.

This application provides a communication method and apparatus that can reduce the computational complexity of detecting information carrying a first bit, improve detection efficiency, and enhance communication performance. The method includes: determining a first signal based on a first sequence corresponding to the first bit information, wherein the first sequence is constructed based on the Kronecker product of a second sequence and a third sequence, the second sequence carrying the first bit of the first bit information and the third sequence carrying the second bit of the first bit information; and transmitting the first signal.

The invention relates to the technical field of communication, and discloses a Turbo code probability domain decoding method and device based on a storage and calculation all-in-one device, which are applied to a decoding end. According to the method, an expansion check matrix and a probability graph model can be constructed, and a storage and calculation all-in-one device sub-array and a driving vector corresponding to each undirected edge are configured according to the expansion check matrix, the probability graph model and a probability domain operation mode; and interpreting the Turbo code to be interpreted based on the storage and calculation integrator sub-array corresponding to each undirected edge, the driving vector and the confidence coefficient of each variable node transmitting the own state value to each check node connected through the undirected edge to obtain corresponding original bit information. According to the invention, part of static variables involved in Turbo decoding can be stored in the storage and calculation all-in-one device based on the probability field, part of digital operation is transferred to the storage and calculation all-in-one device, operation is carried out by using the storage and calculation performance of the storage and calculation all-in-one device, and the hardware resource consumption and power consumption of the Turbo code are remarkably reduced while the excellent error correction capability of the Turbo code is reserved.

The invention provides an intelligent reflector-assisted symbiotic sense semantic bit secure transmission method, and relates to the technical field of wireless communication. Due to the fact that an eavesdropper only has a semantic-oriented communication structure, the intelligent reflecting surface can modulate a bit signal generated by the intelligent reflecting surface into an incident semantic signal through reflected beam forming, and therefore the intelligibility of semantic data is destroyed. The superposed signals can construct a mutualism relationship for expected legal users, and form a parasitic interference relationship for eavesdroppers at the same time. Based on the constructed system model, a semantic security rate maximization problem is constructed, and the problem needs to meet the lowest service quality requirements of bit data decoding and target perception. According to the method, an original problem is decomposed into a plurality of sub-problems, the sub-problems can be solved by deriving a closed-form solution or converting the sub-problems into an equivalent convex form, and the method is remarkably superior to a traditional reference scheme in the aspect of semantic security.

This disclosure presents embodiments of an error correction decoding method, an error correction coding method, an apparatus, an electronic device, and a medium. One specific implementation of the method includes: demodulating a symbol information sequence to obtain a demodulated information group sequence, wherein the demodulated information group sequence includes a demodulated bit information sequence and a confidence information sequence, and the demodulated bit information sequence is a bit information sequence with even parity characteristics; determining a codeword starting point code length information group sequence based on a preset code length information sequence; generating target codeword starting point information and target code length information based on the codeword starting point code length information group sequence and the demodulated bit information sequence; deblurring the demodulated bit information sequence based on the target codeword starting point information and target code length information to obtain a deblurred information sequence; and decoding the deblurred information sequence based on the confidence information sequence to obtain a decoded codeword sequence. This implementation reduces the waste of bandwidth and spectrum resources.

The invention provides a security analysis method for an RSA variant cryptographic algorithm, attack on the variant cryptographic algorithm is realized by using leaked high bit and low bit information of a private key and a Appersmith algorithm, the leaked private key information can be effectively utilized, the prior art is broken through, and bit information required for attack is reduced. In addition, the invention also provides a security analysis device for the RSA variant cryptographic algorithm and a storage medium.

The present application provides a communication method and apparatus, capable of reducing the computational complexity in detecting carried first bit information, improving the detection efficiency, and improving the communication performance. The method comprises: determining a first signal on the basis of a first sequence corresponding to first bit information, wherein the first sequence is constructed on the basis of a Kronecker product of a second sequence and a third sequence, the second sequence carries a first bit in the first bit information, and the third sequence carries a second bit in the first bit information; and sending the first signal.

The invention discloses a wake-up information transmission method and a communication device, and the method comprises the steps: receiving a first signal, the first signal is modulated based on a first sequence, the first sequence carries wake-up information and / or bit information, and the bit information is part of information in the wake-up information; by adopting the method, the reliability can be improved, and fading can be resisted.

A receiver according to the present disclosure includes: a first modulation unit that modulates a phase of a reference light by using a reception base assigned so as to correspond to a transmission base assigned to each of a plurality of weak lights; a detection unit that detects a plurality of pieces of bit information from each of the plurality of weak lights interfered with by the reference light in which a base value of the reception base matches that of the transmission base; an extraction unit that extracts a plurality of pieces of bit information each having an amplitude component equal to or greater than a threshold; a prediction unit configured to predict a load status of the receiver based on information about a weather forecast; and an adjustment unit that adjusts the threshold in accordance with the predicted load status of the receiver.

The invention mainly relates to the technical field of encryption communication, in particular to a 32-bit polar code compiling technology, discloses a method for reducing the calculation complexity and time delay of a 32-bit polar code codec and application thereof, and is suitable for short packet data communication (such as LoRa radio frequency chip physical layer frame header coding and decoding). According to the method and the device, the calculation of freezing bit nodes is avoided by finely adjusting the channel reliability sequence (for example, replacing a bit channel 16 with 20) based on the polarization weight structure and performing node cutting on the Trellis graph of the SC decoder. According to the method, the calculation complexity is reduced to 46% of that of an original scheme, the time delay is reduced by about 2 / 3, and under the condition that the bit error rate is slightly sacrificed (the BER is degraded by 0.3 dB), the BER gain which is about 1.8 dB compared with that of a Hamming code is achieved. According to the method and the device, the problems of high complexity and large time delay of a traditional polarization code in a short code length scene are solved, the communication reliability in a low signal-to-noise ratio environment is remarkably improved, and the method and the device are suitable for low-power-consumption Internet of Things equipment.

The application provides a polar code decoding method and device, a computing device and a storage medium. The technical scheme of the application comprises: obtaining a code block sequence of a polar code; performing a round of SC decoding on M-bit bits in the code block sequence in a maximum of L SC decoders in sequence every round; the SC decoding in each round of iteration is parallelly expanded on the surviving path of the last round, to generate a candidate path, and a maximum of L surviving paths in the current round are obtained from the candidate path; and when the SC decoding of the code block sequence is completed, the bit information of the surviving path with the minimum path metric value is taken as a decoding result. Compared with the traditional SCL decoding method, the technical scheme of the application provides more traversal samples every round, retains fewer surviving paths, has smaller memory resource and CPU resource consumption of SC decoding, is faster in path traversal speed, and is higher in decoding efficiency.

A communication method and apparatus, which are applied to the technical field of communications. In the method, a terminal apparatus sends a first signal obtained by modulating a first sequence and performing resource mapping on the modulated signal. The first sequence is obtained by modifying a Gold sequence carrying source bits, and the Gold sequence carrying source bits is implemented by means of two m-sequences in the Gold sequence each carrying part of the source bits. In the method, the Gold sequence can carry more information bits, so that bit information having a large data volume can be transmitted.