相关期刊:《The Journal of China Universities of Posts and Telecommunications》《Science China Mathematics》《Wuhan University Journal of Natural Sciences》《Chinese Physics B》更多>>
In the process of quantum key distribution(QKD), the communicating parties need to randomly determine quantum states and measurement bases. To ensure the security of key distribution, we aim to use true random sequenc...
the National Natural Science Foundation of China (Nos. 61531009 and 61471108);the National Major Project Foundation of China (No. 2016ZX03001009);the Natural Science Foundation of Hebei Province (No. F2017506006)。
To improve the signal detection performance of binary-sequence frequency hopping communication when the complementary channel is jammed, a binary-sequence frequency hopping communication system based on pseudo-random ...
supported in part by the Open Funds of Key Lab of Fujian Province University Network Security and Cryptology(Grant No. 07B005);the Funds of the Education Department of Fujian Province (Grant No. JA07164) ;the Natural Science Foundation of Fujian Province of China (Grant No. 2007F3086).
We review the constructions of two main kinds of generalized cyclotomic binary sequences with length pq (the product with two distinct primes). One is the White-generalized cyclotomic sequences, the other is the Din...
The design of an FPGA( field programmable gate array) based programmable SONET (synchronous optical network) OC-192 10 Gbit/s PRBS (pseudo-random binary sequence) generator and a bit interleaved polarity 8 (BI...
In a secure group communication system, messages must be encrypted before being transmitted to group members to prevent unauthorized access. In many secure group communication schemes, whenever a member leaves or join...
Supported by the National Natural Science Foundation of China under Grant 69972042
This paper presents the definition of perfect punctured binary sequence pair and the combinatorial admissible conditions for searching the perfect punctured binary sequence pairs and proves that all of the pseudo-rand...
This paper presents two practical message commitment schemes: one is suitable for committing many bits, and another is useful for committing any bit-long message. They are provably secure based on pseudo-random synthe...
This paper proposes new hierarchical structures for generating pseudorandom sequences and arrays. The principle of the structures is based on a new concept-multi-interleaving. It is the generalization of normal sequen...