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....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.展开更多
Today＇s emergence of nano-micro hybrid structures with almost biological complexity is of fundamental interest. Our ability to adapt intelligently to the challenges has ramifications all the way from fundamentally ch...Today＇s emergence of nano-micro hybrid structures with almost biological complexity is of fundamental interest. Our ability to adapt intelligently to the challenges has ramifications all the way from fundamentally changing research itself, over applications critical to future survival, to posing globally existential dangers. Touching on specific issues such as how complexity relates to the catalytic prowess of multi-metal compounds, we discuss the increasingly urgent issues in nanotechnology also very generally and guided by the motto ＇Bio Is Nature＇s Nanotech＇. Technology belongs to macro-evolution; for example integration with artificial intelligence （AI） is inevitable. Darwinian adaptation manifests as integration of complexity, and awareness of this helps in developing adaptable research methods that can find use across a wide range of research. The second half of this work reviews a diverse range of projects which all benefited from ＇playful＇ programming aimed at dealing with complexity. The main purpose of reviewing them is to show how such projects benefit from and fit in with the general, philosophical approach, proving the relevance of the ＇big picture＇ where it is usually disregarded.展开更多
基金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.
基金jointly supported by the Natural Science Foundation of Jiangsu Province (No.2012729)the Innovation Fund of Jiangsu Province (No.BY2013072-06)the National Natural Science Foundation of China (No.51171078 and No.11374136)
文摘Today＇s emergence of nano-micro hybrid structures with almost biological complexity is of fundamental interest. Our ability to adapt intelligently to the challenges has ramifications all the way from fundamentally changing research itself, over applications critical to future survival, to posing globally existential dangers. Touching on specific issues such as how complexity relates to the catalytic prowess of multi-metal compounds, we discuss the increasingly urgent issues in nanotechnology also very generally and guided by the motto ＇Bio Is Nature＇s Nanotech＇. Technology belongs to macro-evolution; for example integration with artificial intelligence （AI） is inevitable. Darwinian adaptation manifests as integration of complexity, and awareness of this helps in developing adaptable research methods that can find use across a wide range of research. The second half of this work reviews a diverse range of projects which all benefited from ＇playful＇ programming aimed at dealing with complexity. The main purpose of reviewing them is to show how such projects benefit from and fit in with the general, philosophical approach, proving the relevance of the ＇big picture＇ where it is usually disregarded.
