Obfuscation methods with controlled calculation amounts and table tunction

Yuan Yu Wei, Kazuo Ohzeki

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

Abstract

This paper describes a new obfuscarion method with two techniques by which both computational complexity can be controlled and semantic obfuscation can be achieved. The computational complexity can be strictly controlled by using the technique of encryption. The computational complexity can be arbitrarily specified by the impossibility of factorization of prime numbers by length from one second to about one year. Semantic obfuscation is achieved by transforming a function into a table function. A nonlinear, arbitrary function can be incorporated into the functions, while only linear functions are used in the conventional methods. Because the explicit function form is hidden, it is thought that analysis takes time. The computational complexity technique and semantic technique can be used at the same time, aucl the effect of integrated obfuscation with both techniques is great.

Original languageEnglish
Title of host publicationProceedings of the International Multiconference on Computer Science and Information Technology, IMCSIT 2010
Pages775-780
Number of pages6
Volume5
Publication statusPublished - 2010
Externally publishedYes
Event2010 International Multiconference on Computer Science and Information Technology, IMCSIT 2010 - Wisla
Duration: 2010 Oct 182010 Oct 20

Other

Other2010 International Multiconference on Computer Science and Information Technology, IMCSIT 2010
CityWisla
Period10/10/1810/10/20

Fingerprint

Computational complexity
Semantics
Factorization
Cryptography

ASJC Scopus subject areas

  • Computer Science (miscellaneous)
  • Information Systems

Cite this

Wei, Y. Y., & Ohzeki, K. (2010). Obfuscation methods with controlled calculation amounts and table tunction. In Proceedings of the International Multiconference on Computer Science and Information Technology, IMCSIT 2010 (Vol. 5, pp. 775-780). [5680052]

Obfuscation methods with controlled calculation amounts and table tunction. / Wei, Yuan Yu; Ohzeki, Kazuo.

Proceedings of the International Multiconference on Computer Science and Information Technology, IMCSIT 2010. Vol. 5 2010. p. 775-780 5680052.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Wei, YY & Ohzeki, K 2010, Obfuscation methods with controlled calculation amounts and table tunction. in Proceedings of the International Multiconference on Computer Science and Information Technology, IMCSIT 2010. vol. 5, 5680052, pp. 775-780, 2010 International Multiconference on Computer Science and Information Technology, IMCSIT 2010, Wisla, 10/10/18.
Wei YY, Ohzeki K. Obfuscation methods with controlled calculation amounts and table tunction. In Proceedings of the International Multiconference on Computer Science and Information Technology, IMCSIT 2010. Vol. 5. 2010. p. 775-780. 5680052
Wei, Yuan Yu ; Ohzeki, Kazuo. / Obfuscation methods with controlled calculation amounts and table tunction. Proceedings of the International Multiconference on Computer Science and Information Technology, IMCSIT 2010. Vol. 5 2010. pp. 775-780
@inproceedings{07050c9b4ada4a1da902ec79753fbb03,
title = "Obfuscation methods with controlled calculation amounts and table tunction",
abstract = "This paper describes a new obfuscarion method with two techniques by which both computational complexity can be controlled and semantic obfuscation can be achieved. The computational complexity can be strictly controlled by using the technique of encryption. The computational complexity can be arbitrarily specified by the impossibility of factorization of prime numbers by length from one second to about one year. Semantic obfuscation is achieved by transforming a function into a table function. A nonlinear, arbitrary function can be incorporated into the functions, while only linear functions are used in the conventional methods. Because the explicit function form is hidden, it is thought that analysis takes time. The computational complexity technique and semantic technique can be used at the same time, aucl the effect of integrated obfuscation with both techniques is great.",
author = "Wei, {Yuan Yu} and Kazuo Ohzeki",
year = "2010",
language = "English",
isbn = "9788360810279",
volume = "5",
pages = "775--780",
booktitle = "Proceedings of the International Multiconference on Computer Science and Information Technology, IMCSIT 2010",

}

TY - GEN

T1 - Obfuscation methods with controlled calculation amounts and table tunction

AU - Wei, Yuan Yu

AU - Ohzeki, Kazuo

PY - 2010

Y1 - 2010

N2 - This paper describes a new obfuscarion method with two techniques by which both computational complexity can be controlled and semantic obfuscation can be achieved. The computational complexity can be strictly controlled by using the technique of encryption. The computational complexity can be arbitrarily specified by the impossibility of factorization of prime numbers by length from one second to about one year. Semantic obfuscation is achieved by transforming a function into a table function. A nonlinear, arbitrary function can be incorporated into the functions, while only linear functions are used in the conventional methods. Because the explicit function form is hidden, it is thought that analysis takes time. The computational complexity technique and semantic technique can be used at the same time, aucl the effect of integrated obfuscation with both techniques is great.

AB - This paper describes a new obfuscarion method with two techniques by which both computational complexity can be controlled and semantic obfuscation can be achieved. The computational complexity can be strictly controlled by using the technique of encryption. The computational complexity can be arbitrarily specified by the impossibility of factorization of prime numbers by length from one second to about one year. Semantic obfuscation is achieved by transforming a function into a table function. A nonlinear, arbitrary function can be incorporated into the functions, while only linear functions are used in the conventional methods. Because the explicit function form is hidden, it is thought that analysis takes time. The computational complexity technique and semantic technique can be used at the same time, aucl the effect of integrated obfuscation with both techniques is great.

UR - http://www.scopus.com/inward/record.url?scp=79551521527&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=79551521527&partnerID=8YFLogxK

M3 - Conference contribution

SN - 9788360810279

VL - 5

SP - 775

EP - 780

BT - Proceedings of the International Multiconference on Computer Science and Information Technology, IMCSIT 2010

ER -