作者：
TSUNOO, YOKAMOTO, EUEMATSU, TMemberNEC Software Hokuriku
Ltd. Ishikawa Japan 920-21 School of Information Science
Japan Advanced Institute of Science and Technology Ishikawa Japan 923-12 MembersTomohiko Uyematsu graduated in Electrical Engineering from Tokyo Institute of Technology in 1982 and received a Master's degree from the same university in 1984
after whichhe became an assistant in the Electrical and Electronics Engineering Department there. In1990 he became a Lecturer and in 1991 an Assistant Professor. In 1992 he became Assistant Professor at the School of Information Science Japan Advanced Institute of Science and Technology. He holds a doctorate in engineering. Among his research interests are signal theory optical communications theory coding theory and data compression algorithms. In 1988 he received a Shinohara Commemorative Science Encouragement Prize and in 1992 a Best Paper Award. He is the author of the bookIntroduction to Record Data Compression Algorithms. He is a member of the Measurement Control Society and the Society for Information Theory and Its Applications.
Cryptology provides the technological basis for guaranteed network security. In the field of business, to guarantee the security of information, everyone needs easy-to-use cryptology. Starting with the announcement by...
详细信息
Cryptology provides the technological basis for guaranteed network security. In the field of business, to guarantee the security of information, everyone needs easy-to-use cryptology. Starting with the announcement by the U.S. National Bureau of Standards of the DES cryptosystem and the proposal by NTT of the FEAL cryptosystem, secret-key cryptographic algorithms have been published, involution-type block cryptosystems which use secret key to encipher 64 bits of plain text as 64 bits of cipher text [2, 3, 9, 10, 12]. NTT has proposed the one-way function MAP, which is also an involution-type transform. In this paper, we study a new cryptanalytic method for involution-type cryptosystems and show by example that it can be applied practically in a ciphertext-only attack on the one-way function MAP. For an involution-type cryptosystem, by increasing the amount of construction in the data-randomization phase and by increasing the size of the secret key, we can guarantee the computational security by preventing the estimation of the secret key. However, if we study the properties of the function used in the design of the data-randomization phase, by specifying input/output values of the function which are independent of the secret key, it may be possible to use the inverse function [11] to calculate the secret key. This method is called the intermediate cipher method. The intermediate cipher method differs from previous methods in the small quantity of data required for breaking.
Removing the bias and variance of multicentre data has always been a challenge in large scale digital healthcare studies, which requires the ability to integrate clinical features extracted from data acquired by diffe...
详细信息
暂无评论