Two obfuscation methods by controlling calculation amounts and by table function for watermark

YuanYu Wei, Kazuo Ohzeki

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

This paper describes new two obfuscation methods the fist method can control computational complexity and the second method can achieve semantic obfuscation. The computational complexity can be strictly controlled by using the technique of RSA encryption. The computational complexity can be arbitrarily specified by the impossibility of factorization of prime number in RSA encryption method. Semantic obfuscation is achieved by transforming a function into a table function. The table function method only shows input data and output data .It hides all the intermediate processing data. 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, by embedding the table function into the program with computational complexity method.

Original languageEnglish
Pages (from-to)110-122
Number of pages13
JournalInternational Journal of Computer Science and Applications
Volume8
Issue number1
Publication statusPublished - 2011

Fingerprint

Computational complexity
Semantics
Cryptography
Factorization

Keywords

  • Complexity
  • JPEG semantic
  • Prime number
  • RSA cipher

ASJC Scopus subject areas

  • Computer Science Applications

Cite this

Two obfuscation methods by controlling calculation amounts and by table function for watermark. / Wei, YuanYu; Ohzeki, Kazuo.

In: International Journal of Computer Science and Applications, Vol. 8, No. 1, 2011, p. 110-122.

Research output: Contribution to journalArticle

@article{5c180384d1224ebd99ead3921a7295b0,
title = "Two obfuscation methods by controlling calculation amounts and by table function for watermark",
abstract = "This paper describes new two obfuscation methods the fist method can control computational complexity and the second method can achieve semantic obfuscation. The computational complexity can be strictly controlled by using the technique of RSA encryption. The computational complexity can be arbitrarily specified by the impossibility of factorization of prime number in RSA encryption method. Semantic obfuscation is achieved by transforming a function into a table function. The table function method only shows input data and output data .It hides all the intermediate processing data. 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, by embedding the table function into the program with computational complexity method.",
keywords = "Complexity, JPEG semantic, Prime number, RSA cipher",
author = "YuanYu Wei and Kazuo Ohzeki",
year = "2011",
language = "English",
volume = "8",
pages = "110--122",
journal = "International Journal of Computer Science and Applications",
issn = "0972-9038",
publisher = "Technomathematics Research Foundation",
number = "1",

}

TY - JOUR

T1 - Two obfuscation methods by controlling calculation amounts and by table function for watermark

AU - Wei, YuanYu

AU - Ohzeki, Kazuo

PY - 2011

Y1 - 2011

N2 - This paper describes new two obfuscation methods the fist method can control computational complexity and the second method can achieve semantic obfuscation. The computational complexity can be strictly controlled by using the technique of RSA encryption. The computational complexity can be arbitrarily specified by the impossibility of factorization of prime number in RSA encryption method. Semantic obfuscation is achieved by transforming a function into a table function. The table function method only shows input data and output data .It hides all the intermediate processing data. 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, by embedding the table function into the program with computational complexity method.

AB - This paper describes new two obfuscation methods the fist method can control computational complexity and the second method can achieve semantic obfuscation. The computational complexity can be strictly controlled by using the technique of RSA encryption. The computational complexity can be arbitrarily specified by the impossibility of factorization of prime number in RSA encryption method. Semantic obfuscation is achieved by transforming a function into a table function. The table function method only shows input data and output data .It hides all the intermediate processing data. 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, by embedding the table function into the program with computational complexity method.

KW - Complexity

KW - JPEG semantic

KW - Prime number

KW - RSA cipher

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

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

M3 - Article

VL - 8

SP - 110

EP - 122

JO - International Journal of Computer Science and Applications

JF - International Journal of Computer Science and Applications

SN - 0972-9038

IS - 1

ER -