A Switching Closure Test to Analyze Cryptosystems

Hikaru MORITA; Kazuo OHTA

A Switching Closure Test to Analyze Cryptosystems

Hikaru MORITA, Kazuo OHTA

Full Text Views

0

Share
Cite this

Summary :

A closure test MCT (meet-in-the-middle closure test) has been introduced to analyze the algebraic properties of cryptosystems. Since MCT needs a large amount of memory, it is hard to implement with an ordinary meet-in-the-middle method. As a feasible version of MCT, this paper presents a switching closure test SCT based on a new memoryless meet-in-the-middle method. To achieve the memoryless method, appropriate techniques, such as expansion of cycling detection methods for one function into a method for two functions and an efficient intersection search method that uses only a small amount of memory, are effectively used.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E75-A No.4 pp.498-503

Publication Date: 1992/04/25

Publicized

Online ISSN

DOI

Type of Manuscript: Special Section PAPER (Special Issue on Discrete Mathematics and Its Application)

Category

Cite this

Copy

Hikaru MORITA, Kazuo OHTA, "A Switching Closure Test to Analyze Cryptosystems" in IEICE TRANSACTIONS on Fundamentals, vol. E75-A, no. 4, pp. 498-503, April 1992, doi: .
Abstract: A closure test MCT (meet-in-the-middle closure test) has been introduced to analyze the algebraic properties of cryptosystems. Since MCT needs a large amount of memory, it is hard to implement with an ordinary meet-in-the-middle method. As a feasible version of MCT, this paper presents a switching closure test SCT based on a new memoryless meet-in-the-middle method. To achieve the memoryless method, appropriate techniques, such as expansion of cycling detection methods for one function into a method for two functions and an efficient intersection search method that uses only a small amount of memory, are effectively used.
URL: https://globals.ieice.org/en_transactions/fundamentals/10.1587/e75-a_4_498/_p

Copy

@ARTICLE{e75-a_4_498,
author={Hikaru MORITA, Kazuo OHTA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A Switching Closure Test to Analyze Cryptosystems},
year={1992},
volume={E75-A},
number={4},
pages={498-503},
abstract={A closure test MCT (meet-in-the-middle closure test) has been introduced to analyze the algebraic properties of cryptosystems. Since MCT needs a large amount of memory, it is hard to implement with an ordinary meet-in-the-middle method. As a feasible version of MCT, this paper presents a switching closure test SCT based on a new memoryless meet-in-the-middle method. To achieve the memoryless method, appropriate techniques, such as expansion of cycling detection methods for one function into a method for two functions and an efficient intersection search method that uses only a small amount of memory, are effectively used.},
keywords={},
doi={},
ISSN={},
month={April},}

Copy

TY - JOUR
TI - A Switching Closure Test to Analyze Cryptosystems
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 498
EP - 503
AU - Hikaru MORITA
AU - Kazuo OHTA
PY - 1992
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E75-A
IS - 4
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - April 1992
AB - A closure test MCT (meet-in-the-middle closure test) has been introduced to analyze the algebraic properties of cryptosystems. Since MCT needs a large amount of memory, it is hard to implement with an ordinary meet-in-the-middle method. As a feasible version of MCT, this paper presents a switching closure test SCT based on a new memoryless meet-in-the-middle method. To achieve the memoryless method, appropriate techniques, such as expansion of cycling detection methods for one function into a method for two functions and an efficient intersection search method that uses only a small amount of memory, are effectively used.
ER -