In the quantum Monte Carlo(QMC)method,the pseudo-random number generator(PRNG)plays a crucial role in determining the computation time.However,the hidden structure of the PRNG may lead to serious issues such as the br...In the quantum Monte Carlo(QMC)method,the pseudo-random number generator(PRNG)plays a crucial role in determining the computation time.However,the hidden structure of the PRNG may lead to serious issues such as the breakdown of the Markov process.Here,we systematically analyze the performance of different PRNGs on the widely used QMC method known as the stochastic series expansion(SSE)algorithm.To quantitatively compare them,we introduce a quantity called QMC efficiency that can effectively reflect the efficiency of the algorithms.After testing several representative observables of the Heisenberg model in one and two dimensions,we recommend the linear congruential generator as the best choice of PRNG.Our work not only helps improve the performance of the SSE method but also sheds light on the other Markov-chain-based numerical algorithms.展开更多
This paper presents a low power,truly random number generator （TRNG） based on a simple chaotic map of the Bernoulli shift,which is extended to remain robustness in implementation. The map is realized by switched-cur...This paper presents a low power,truly random number generator （TRNG） based on a simple chaotic map of the Bernoulli shift,which is extended to remain robustness in implementation. The map is realized by switched-current techniques that can fully integrate it in a cryptosystem on a chip. A pipelined architecture post-processed by a simple XOR circuit is used to improve the entropy. The TRNG is fabricated in an HJTC 0.18μm CMOS mixed signal process,and the statistical properties are investigated by measurement results. The power consumption is only 1.42mW and the truly random output bit rate is 10Mbit/s.展开更多
This paper proposes a novel single electron random number generator （RNG）. The generator consists of multiple tunneling junctions （MTJ） and a hybrid single electron transistor （SET）/MOS output circuit. It is an ...This paper proposes a novel single electron random number generator （RNG）. The generator consists of multiple tunneling junctions （MTJ） and a hybrid single electron transistor （SET）/MOS output circuit. It is an oscillator-based RNG. MTJ is used to implement a high-frequency oscillator, which uses the inherent physical randomness in tunneling events of the MTJ to achieve large frequency drift. The hybrid SET and MOS output circuit is used to amplify and buffer the output signal of the MTJ oscillator. The RNG circuit generates high-quality random digital sequences with a simple structure. The operation speed of this circuit is as high as 1GHz. The circuit also has good driven capability and low power dissipation. This novel random number generator is a promising device for future cryptographic systems and communication applications.展开更多
In plasmonic systems, the response of nanoobjects under light illumination can produce complex optical maps. Such plasmonic or resonant systems have interesting characteristics such as sensitivity on parameters and in...In plasmonic systems, the response of nanoobjects under light illumination can produce complex optical maps. Such plasmonic or resonant systems have interesting characteristics such as sensitivity on parameters and initial conditions. In this paper, we show how these complex maps can be cryptographically improved and associated in order to design a secure pseudo random number generator.展开更多
Quantum random number generators adopting single negligible dead time of avalanche photodiodes （APDs） photon detection have been restricted due to the non- We propose a new approach based on an APD array to improve...Quantum random number generators adopting single negligible dead time of avalanche photodiodes （APDs） photon detection have been restricted due to the non- We propose a new approach based on an APD array to improve the generation rate of random numbers significantly. This method compares the detectors＇ responses to consecutive optical pulses and generates the random sequence. We implement a demonstration experiment to show its simplicity, compactness and scalability. The generated numbers are proved to be unbiased, post-processing free, ready to use, and their randomness is verified by using the national institute of standard technology statistical test suite. The random bit generation efficiency is as high as 32.8% and the potential generation rate adopting the 32× 32 APD array is up to tens of Gbits/s.展开更多
Random numbers play an increasingly important role in secure wire and wireless communication. Thus the design quality of random number generator(RNG) is significant in information security. A novel pseudo RNG is propo...Random numbers play an increasingly important role in secure wire and wireless communication. Thus the design quality of random number generator(RNG) is significant in information security. A novel pseudo RNG is proposed for improving the security of network communication. The back propagation neural network(BPNN) is nonlinear, which can be used to improve the traditional RNG. The novel pseudo RNG is based on BPNN techniques. The result of test suites standardized by the U.S shows that the RNG can satisfy the security of communication.展开更多
The generation of good pseudo-random numbers is the base of many important fields in scientific computing, such as randomized algorithms and numerical solution of stochastic differential equations. In this paper, a cl...The generation of good pseudo-random numbers is the base of many important fields in scientific computing, such as randomized algorithms and numerical solution of stochastic differential equations. In this paper, a class of random number generators （RNGs） based on Weyl sequence is proposed. The uniformity of those RNGs is proved theoretically. Statistical and numerical computations show the efficiency of the methods.展开更多
Given two graphs G and H,the Ramsey number R(G,H)is the smallest positive integer N such that every 2-coloring of the edges of K_(N)contains either a red G or a blue H.Let K_(N-1)■K_(1,k)be the graph obtained from K_...Given two graphs G and H,the Ramsey number R(G,H)is the smallest positive integer N such that every 2-coloring of the edges of K_(N)contains either a red G or a blue H.Let K_(N-1)■K_(1,k)be the graph obtained from K_(N-1)by adding anew vertexνconnecting k vertices of K_(N-1).A graph G withχ(G)=k+1 is called edge-critical if G contains an edge e such thatχ(G-e)=k.A considerable amount of research has been conducted by previous scholars on Ramsey numbers ofgraphs.In this study,we show that for an edge-critical graph G with x(G)=k+1,when k≥2,1≥2,and n is sufficiently large,R(G,K_(1)+nK_(t))=knt+1 and r,(G,K_(1)+nK_(t))=(k-1)nt+1.展开更多
In 1694,Gregory and Newton proposed the problem to determine the kissing number of a rigid material ball.This problem and its higher dimensional generalization have been studied by many mathematicians,including Minkow...In 1694,Gregory and Newton proposed the problem to determine the kissing number of a rigid material ball.This problem and its higher dimensional generalization have been studied by many mathematicians,including Minkowski,van der Waerden,Hadwiger,Swinnerton-Dyer,Watson,Levenshtein,Odlyzko,Sloane and Musin.In this paper,we introduce and study a further generalization of the kissing numbers for convex bodies and obtain some exact results,in particular for balls in dimensions three,four and eight.展开更多
In recent years, various chaotic equation based pseudorandom number generators have been proposed. However, the chaotic equations are all defined in the real number field. In this paper, an equation is proposed and pr...In recent years, various chaotic equation based pseudorandom number generators have been proposed. However, the chaotic equations are all defined in the real number field. In this paper, an equation is proposed and proved to be chaotic in the imaginary axis. And a pseudorandom number generator is constructed based on the chaotic equation. The alteration of the definitional domain of the chaotic equation from the real number field to the complex one provides a new approach to the construction of chaotic equations, and a new method to generate pseudorandorn number sequences accordingly. Both theoretical analysis and experimental results show that the sequences generated by the proposed pseudorandom number generator possess many good properties.展开更多
This paper proposes a well-performing hybrid-type truly quantum random number generator based on the time interval between two independent single-photon detection signals, which is practical and intuitive, and generat...This paper proposes a well-performing hybrid-type truly quantum random number generator based on the time interval between two independent single-photon detection signals, which is practical and intuitive, and generates the initial random number sources from a combination of multiple existing random number sources. A time-to-amplitude converter and multichannel analyzer are used for qualitative analysis to demonstrate that each and every step is random. Furthermore, a carefully designed data acquisition system is used to obtain a high-quality random sequence. Our scheme is simple and proves that the random number bit rate can be dramatically increased to satisfy practical requirements.展开更多
We propose a biased random number generation protocol whose randomness is based on the violation of the Clauser Home inequality. Non-maximally entangled state is used to maximize the Bell violation. Due to the rotatio...We propose a biased random number generation protocol whose randomness is based on the violation of the Clauser Home inequality. Non-maximally entangled state is used to maximize the Bell violation. Due to the rotational asymmetry of the quantum state, the ratio of Os to ls varies with the measurement bases. The experimental partners can then use their measurement outcomes to generate the biased random bit string. The bias of their bit string can be adjusted by altering their choices of measurement bases. When this protocol is implemented in a device-independent way, we show that the bias of the bit string can still be ensured under the collective attack.展开更多
In real-time applications,unpredictable random numbers play a major role in providing cryptographic and encryption processes.Most of the existing random number generators are embedded with the complex nature of an amp...In real-time applications,unpredictable random numbers play a major role in providing cryptographic and encryption processes.Most of the existing random number generators are embedded with the complex nature of an amplifier,ring oscillators,or comparators.Hence,this research focused more on implementing a Hybrid Nature of a New Random Number Generator.The key objective of the proposed methodology relies on the utilization of True random number generators.The randomness is unpredictable.The additions of programmable delay lines will reduce the processing time and maintain the quality of randomizing.The performance comparisons are carried out with power,delay,and lookup table.The proposed architecture was executed and verified using Xilinx.The Hybrid TRNG is evaluated under simulation and the obtained results outperform the results of the conventional random generators based on Slices,area and Lookup Tables.The experimental observations show that the proposed Hybrid True Random Number Generator(HTRNG)offers high operating speed and low power consumption.展开更多
The standard method to construct a finite field requires a primitive irreducible polynomial of a given degree. Therefore, it is difficult to apply for the construction of huge finite fields. To avoid this problem, we ...The standard method to construct a finite field requires a primitive irreducible polynomial of a given degree. Therefore, it is difficult to apply for the construction of huge finite fields. To avoid this problem, we propose a new method to construct huge finite fields with the characteristic p = 5 by using an Artin-Schreier tower. Utilizing the recursive basis of the Artin-Schreier tower, we define a nmltiplication algorithm The algorithm can explicitly calculate the multiplication of two elements on the top finite field of this tower, without any primitive element. We also define a linear recurrence equation as an application, which produces a sequence of numbers, and call the new pseudorandom number generator Abstract Syntax Tree （AST） for p = 5. The experircental results show that our new pseudorandom number generator can produce a sequence of numbers with a long period.展开更多
This paper presents a fast pseudorandom generation algorithm,which is based on the BLAKE hash function and can pass the random test of the NIST(National Institute of Standards and Technology)Statistical Test Suite.Thr...This paper presents a fast pseudorandom generation algorithm,which is based on the BLAKE hash function and can pass the random test of the NIST(National Institute of Standards and Technology)Statistical Test Suite.Through theoretical analysis and experimental imitation,our new algorithm is proven to be more secure and efficient than G-SHA1.Simultaneously,we introduce and discuss the BLAKE in detail.Its security shows that can be utilized to generate pseudorandom bit sequences,which the experimental results show the BLAKE hash function has excellent pseudorandomness.Therefore,we believe the BLAKE is one of the most potential candidate algorithms of SHA-3 program.展开更多
With the rapid development of cryptography, the strength of security protocols and encryption algorithms consumedly relies on the quality of random number. In many cryptography applications, higher speed is one of the...With the rapid development of cryptography, the strength of security protocols and encryption algorithms consumedly relies on the quality of random number. In many cryptography applications, higher speed is one of the references required. A new security random number generator architecture is presented. Its philosophy architecture is implemented with FPGA, based on the thermal noise and linear feedback shift register(LFSR). The thermal noise initializes LFSRs and is used as the disturbed source of the system to ensure the unpredictability of the produced random number and improve the security strength of the system. Parallel LFSRs can produce the pseudo-random numbers with long period and higher speed. The proposed architecture can meet the requirements of high quality and high speed in cryptography.展开更多
How to estimate the randomness of the measurement outcomes generated by a given device is an important issue in quantum information theory. Recently, Brunner et al. [Phys. Rev. Lett. 112 （2014）140407] proposed a pre...How to estimate the randomness of the measurement outcomes generated by a given device is an important issue in quantum information theory. Recently, Brunner et al. [Phys. Rev. Lett. 112 （2014）140407] proposed a prepare-and-measure quantum random number generation scenario with device-independent assumption, which indicates a method to test the randomness of bit strings according to the generation process rather than the results. Based on this protocol, we implement a quantum random number generator with an intrinsic stable phase-encoded quantum key distribution system. The system has been continuously running for more than 200 h, a stable witness W with the average value of 0.9752 and a standard deviation of 0.0024 are obtained. More than 1 G random bits are generated and the results pass all items of NIST test suite.展开更多
A new type of superconductive true random number generator (TRNG) based on a negative-inductance superconducting quantum interference device (nSQUID) is proposed. The entropy harnessed to generate random numbers comes...A new type of superconductive true random number generator (TRNG) based on a negative-inductance superconducting quantum interference device (nSQUID) is proposed. The entropy harnessed to generate random numbers comes from the phenomenon of symmetry breaking in the nSQUID. The experimental circuit is fabricated by the Nb-based lift-off process. Low-temperature tests of the circuit verify the basic function of the proposed TRNG. The frequency characteristics of the TRNG have been analyzed by simulation. The generation rate of random numbers is expected to achieve hundreds of megahertz to tens of gigahertz.展开更多
The purpose of this paper is to define the generalized Euler numbers and the generalized Euler numbers of higher order, their recursion formula and some properties were established, accordingly Euler numbers and Euler...The purpose of this paper is to define the generalized Euler numbers and the generalized Euler numbers of higher order, their recursion formula and some properties were established, accordingly Euler numbers and Euler numbers of higher order were extended.展开更多
基金Project supported by the National Natural Science Foundation of China(Grant Nos.12274046,11874094,and 12147102)Chongqing Natural Science Foundation(Grant No.CSTB2022NSCQ-JQX0018)Fundamental Research Funds for the Central Universities(Grant No.2021CDJZYJH-003).
文摘In the quantum Monte Carlo(QMC)method,the pseudo-random number generator(PRNG)plays a crucial role in determining the computation time.However,the hidden structure of the PRNG may lead to serious issues such as the breakdown of the Markov process.Here,we systematically analyze the performance of different PRNGs on the widely used QMC method known as the stochastic series expansion(SSE)algorithm.To quantitatively compare them,we introduce a quantity called QMC efficiency that can effectively reflect the efficiency of the algorithms.After testing several representative observables of the Heisenberg model in one and two dimensions,we recommend the linear congruential generator as the best choice of PRNG.Our work not only helps improve the performance of the SSE method but also sheds light on the other Markov-chain-based numerical algorithms.
文摘This paper presents a low power,truly random number generator （TRNG） based on a simple chaotic map of the Bernoulli shift,which is extended to remain robustness in implementation. The map is realized by switched-current techniques that can fully integrate it in a cryptosystem on a chip. A pipelined architecture post-processed by a simple XOR circuit is used to improve the entropy. The TRNG is fabricated in an HJTC 0.18μm CMOS mixed signal process,and the statistical properties are investigated by measurement results. The power consumption is only 1.42mW and the truly random output bit rate is 10Mbit/s.
文摘This paper proposes a novel single electron random number generator （RNG）. The generator consists of multiple tunneling junctions （MTJ） and a hybrid single electron transistor （SET）/MOS output circuit. It is an oscillator-based RNG. MTJ is used to implement a high-frequency oscillator, which uses the inherent physical randomness in tunneling events of the MTJ to achieve large frequency drift. The hybrid SET and MOS output circuit is used to amplify and buffer the output signal of the MTJ oscillator. The RNG circuit generates high-quality random digital sequences with a simple structure. The operation speed of this circuit is as high as 1GHz. The circuit also has good driven capability and low power dissipation. This novel random number generator is a promising device for future cryptographic systems and communication applications.
基金the Region Champagne- Ardennes and the Conseil Regional de l’Aube
文摘In plasmonic systems, the response of nanoobjects under light illumination can produce complex optical maps. Such plasmonic or resonant systems have interesting characteristics such as sensitivity on parameters and initial conditions. In this paper, we show how these complex maps can be cryptographically improved and associated in order to design a secure pseudo random number generator.
基金Supported by the Chinese Academy of Sciences Center for Excellence and Synergetic Innovation Center in Quantum Information and Quantum Physics,Shanghai Branch,University of Science and Technology of Chinathe National Natural Science Foundation of China under Grant No 11405172
文摘Quantum random number generators adopting single negligible dead time of avalanche photodiodes （APDs） photon detection have been restricted due to the non- We propose a new approach based on an APD array to improve the generation rate of random numbers significantly. This method compares the detectors＇ responses to consecutive optical pulses and generates the random sequence. We implement a demonstration experiment to show its simplicity, compactness and scalability. The generated numbers are proved to be unbiased, post-processing free, ready to use, and their randomness is verified by using the national institute of standard technology statistical test suite. The random bit generation efficiency is as high as 32.8% and the potential generation rate adopting the 32× 32 APD array is up to tens of Gbits/s.
基金National Natural Science Foundation of China(60363087 ,90104005 and 60473023)
文摘Random numbers play an increasingly important role in secure wire and wireless communication. Thus the design quality of random number generator(RNG) is significant in information security. A novel pseudo RNG is proposed for improving the security of network communication. The back propagation neural network(BPNN) is nonlinear, which can be used to improve the traditional RNG. The novel pseudo RNG is based on BPNN techniques. The result of test suites standardized by the U.S shows that the RNG can satisfy the security of communication.
基金Supported by National Natural Science Foundation of China （19871047）and National Key Basic Research Special Fund（1998020306）.
文摘The generation of good pseudo-random numbers is the base of many important fields in scientific computing, such as randomized algorithms and numerical solution of stochastic differential equations. In this paper, a class of random number generators （RNGs） based on Weyl sequence is proposed. The uniformity of those RNGs is proved theoretically. Statistical and numerical computations show the efficiency of the methods.
基金supported by the National Key Research and Development Program of China(2023YFA1010200,2020YFA0713100)the National Natural Science Foundation of China(12071453)the Innovation Program for Quantum Science and Technology(2021ZD0302902).
文摘Given two graphs G and H,the Ramsey number R(G,H)is the smallest positive integer N such that every 2-coloring of the edges of K_(N)contains either a red G or a blue H.Let K_(N-1)■K_(1,k)be the graph obtained from K_(N-1)by adding anew vertexνconnecting k vertices of K_(N-1).A graph G withχ(G)=k+1 is called edge-critical if G contains an edge e such thatχ(G-e)=k.A considerable amount of research has been conducted by previous scholars on Ramsey numbers ofgraphs.In this study,we show that for an edge-critical graph G with x(G)=k+1,when k≥2,1≥2,and n is sufficiently large,R(G,K_(1)+nK_(t))=knt+1 and r,(G,K_(1)+nK_(t))=(k-1)nt+1.
基金supported by the National Natural Science Foundation of China(12226006,11921001)the Natural Key Research and Development Program of China(2018YFA0704701).
文摘In 1694,Gregory and Newton proposed the problem to determine the kissing number of a rigid material ball.This problem and its higher dimensional generalization have been studied by many mathematicians,including Minkowski,van der Waerden,Hadwiger,Swinnerton-Dyer,Watson,Levenshtein,Odlyzko,Sloane and Musin.In this paper,we introduce and study a further generalization of the kissing numbers for convex bodies and obtain some exact results,in particular for balls in dimensions three,four and eight.
基金Project supported by the National Natural Science Foundation of China (Grant No. 60973162)the Natural Science Foundation of Shandong Province, China (Grant No. ZR2009GM037)+1 种基金the Science and Technology of Shandong Province, China(Grant No. 2010GGX10132)the Key Program of the Natural Science Foundation of Shandong Province, China (Grant No. Z2006G01)
文摘In recent years, various chaotic equation based pseudorandom number generators have been proposed. However, the chaotic equations are all defined in the real number field. In this paper, an equation is proposed and proved to be chaotic in the imaginary axis. And a pseudorandom number generator is constructed based on the chaotic equation. The alteration of the definitional domain of the chaotic equation from the real number field to the complex one provides a new approach to the construction of chaotic equations, and a new method to generate pseudorandorn number sequences accordingly. Both theoretical analysis and experimental results show that the sequences generated by the proposed pseudorandom number generator possess many good properties.
基金Project supported by the National Natural Science Foundation of China(Grant Nos.61178010 and 11374042)the Fund of State Key Laboratory of Information Photonics and Optical Communications(Beijing University of Posts and Telecommunications),Chinathe Fundamental Research Funds for the Central Universities of China(Grant No.bupt2014TS01)
文摘This paper proposes a well-performing hybrid-type truly quantum random number generator based on the time interval between two independent single-photon detection signals, which is practical and intuitive, and generates the initial random number sources from a combination of multiple existing random number sources. A time-to-amplitude converter and multichannel analyzer are used for qualitative analysis to demonstrate that each and every step is random. Furthermore, a carefully designed data acquisition system is used to obtain a high-quality random sequence. Our scheme is simple and proves that the random number bit rate can be dramatically increased to satisfy practical requirements.
基金Supported by the National Natural Science Foundation of China under Grant Nos 61378011,U1204616 and 11447143the Program for Science and Technology Innovation Talents in Universities of Henan Province under Grant No 2012HASTIT028the Program for Science and Technology Innovation Research Team in University of Henan Province under Grant No 13IRTSTHN020
文摘We propose a biased random number generation protocol whose randomness is based on the violation of the Clauser Home inequality. Non-maximally entangled state is used to maximize the Bell violation. Due to the rotational asymmetry of the quantum state, the ratio of Os to ls varies with the measurement bases. The experimental partners can then use their measurement outcomes to generate the biased random bit string. The bias of their bit string can be adjusted by altering their choices of measurement bases. When this protocol is implemented in a device-independent way, we show that the bias of the bit string can still be ensured under the collective attack.
文摘In real-time applications,unpredictable random numbers play a major role in providing cryptographic and encryption processes.Most of the existing random number generators are embedded with the complex nature of an amplifier,ring oscillators,or comparators.Hence,this research focused more on implementing a Hybrid Nature of a New Random Number Generator.The key objective of the proposed methodology relies on the utilization of True random number generators.The randomness is unpredictable.The additions of programmable delay lines will reduce the processing time and maintain the quality of randomizing.The performance comparisons are carried out with power,delay,and lookup table.The proposed architecture was executed and verified using Xilinx.The Hybrid TRNG is evaluated under simulation and the obtained results outperform the results of the conventional random generators based on Slices,area and Lookup Tables.The experimental observations show that the proposed Hybrid True Random Number Generator(HTRNG)offers high operating speed and low power consumption.
基金supported by Overseas Scholars Research Fund of Heilongjiang Provinicial Education Department
文摘The standard method to construct a finite field requires a primitive irreducible polynomial of a given degree. Therefore, it is difficult to apply for the construction of huge finite fields. To avoid this problem, we propose a new method to construct huge finite fields with the characteristic p = 5 by using an Artin-Schreier tower. Utilizing the recursive basis of the Artin-Schreier tower, we define a nmltiplication algorithm The algorithm can explicitly calculate the multiplication of two elements on the top finite field of this tower, without any primitive element. We also define a linear recurrence equation as an application, which produces a sequence of numbers, and call the new pseudorandom number generator Abstract Syntax Tree （AST） for p = 5. The experircental results show that our new pseudorandom number generator can produce a sequence of numbers with a long period.
基金Supported by the National High Technology Research and Development Program of China (863 Program) ( 2007AA01Z411)the National Natural Science Foundation of China ( 60673071, 60970115 )
文摘This paper presents a fast pseudorandom generation algorithm,which is based on the BLAKE hash function and can pass the random test of the NIST(National Institute of Standards and Technology)Statistical Test Suite.Through theoretical analysis and experimental imitation,our new algorithm is proven to be more secure and efficient than G-SHA1.Simultaneously,we introduce and discuss the BLAKE in detail.Its security shows that can be utilized to generate pseudorandom bit sequences,which the experimental results show the BLAKE hash function has excellent pseudorandomness.Therefore,we believe the BLAKE is one of the most potential candidate algorithms of SHA-3 program.
基金National Natural Science Foundation of China(60373087 and 90104005) Foundation for Doctoral SpecialBranch by Ministry of Education of China(20020486046)
文摘With the rapid development of cryptography, the strength of security protocols and encryption algorithms consumedly relies on the quality of random number. In many cryptography applications, higher speed is one of the references required. A new security random number generator architecture is presented. Its philosophy architecture is implemented with FPGA, based on the thermal noise and linear feedback shift register(LFSR). The thermal noise initializes LFSRs and is used as the disturbed source of the system to ensure the unpredictability of the produced random number and improve the security strength of the system. Parallel LFSRs can produce the pseudo-random numbers with long period and higher speed. The proposed architecture can meet the requirements of high quality and high speed in cryptography.
基金Supported by the National Basic Research Program of China under Grant Nos 2011CBA00200 and 2011CB921200the National Natural Science Foundation of China under Grant Nos 61201239,61205118,11304397 and 61475148the Strategic Priority Research Program(B) of Chinese Academy of Sciences under Grant Nos XDB01030100 and XDB01030300
文摘How to estimate the randomness of the measurement outcomes generated by a given device is an important issue in quantum information theory. Recently, Brunner et al. [Phys. Rev. Lett. 112 （2014）140407] proposed a prepare-and-measure quantum random number generation scenario with device-independent assumption, which indicates a method to test the randomness of bit strings according to the generation process rather than the results. Based on this protocol, we implement a quantum random number generator with an intrinsic stable phase-encoded quantum key distribution system. The system has been continuously running for more than 200 h, a stable witness W with the average value of 0.9752 and a standard deviation of 0.0024 are obtained. More than 1 G random bits are generated and the results pass all items of NIST test suite.
基金Supported by the State Key Program for Basic Research of China under Grant No 2011CBA00304the National Natural Science Foundation of China under Grant No 60836001the Tsinghua University Initiative Scientific Research Program under Grant No 20131089314
文摘A new type of superconductive true random number generator (TRNG) based on a negative-inductance superconducting quantum interference device (nSQUID) is proposed. The entropy harnessed to generate random numbers comes from the phenomenon of symmetry breaking in the nSQUID. The experimental circuit is fabricated by the Nb-based lift-off process. Low-temperature tests of the circuit verify the basic function of the proposed TRNG. The frequency characteristics of the TRNG have been analyzed by simulation. The generation rate of random numbers is expected to achieve hundreds of megahertz to tens of gigahertz.
基金Supported by the NNSF of China(10001016) SF for the Prominent Youth of Henan Province
文摘The purpose of this paper is to define the generalized Euler numbers and the generalized Euler numbers of higher order, their recursion formula and some properties were established, accordingly Euler numbers and Euler numbers of higher order were extended.
