DSpace at EWHA: A note on knapsack problem

Browse

My Repository

View : 599 Download: 0

Full metadata record

DC Field	Value	Language
dc.contributor.author	김현자	-
dc.creator	김현자	-
dc.date.accessioned	2016-08-25T04:08:57Z	-
dc.date.available	2016-08-25T04:08:57Z	-
dc.date.issued	1988	-
dc.identifier.other	OAK-000000022755	-
dc.identifier.uri	https://dspace.ewha.ac.kr/handle/2015.oak/180578	-
dc.identifier.uri	http://dcollection.ewha.ac.kr/jsp/common/DcLoOrgPer.jsp?sItemId=000000022755	-
dc.description.abstract	We give an example to convert Merkle and Hellman knapsack into trapdoor knapsack. We construct the example of knapsack algorithm which is described by Shamir and give the relation between knapsack algorithm and simultaneous diophantine approximation.;Merkle-HelIman knapsack을 trapdoor knapsack으로 대치시키는 것을 예를들어 보인다. Shamir의 knapsack algorithm을 예로서 묘사하고, knapsack algorithm과 simultaneous diophantine approximation의 관계를 준다.	-
dc.description.tableofcontents	ABSTRACT = ⅰ CONTENTS = ⅱ INTRODUCTION = ⅲ Ⅰ. CRYPTOGRAPHIC KNAPSACKS = 1 Ⅱ. MERKLE-HELLMAN KNAPSACKS (SIMPLE KNAPSACK) = 2 Ⅲ. A METHOD FOR CONSTRUCTING TRAPDOOR KNAPSACKS = 3 Ⅳ. MAIN ALGORITHM OF SHAMIR's METHOD = 5 Ⅴ. THE KNAPSACK ALGORITHM AND SIMULTANEOUS DIOPHANTlNE APPROXIMATlON = 10 REFERENCES = 12 논문초록 = 14	-
dc.format	application/pdf	-
dc.format.extent	436734 bytes	-
dc.language	eng	-
dc.publisher	이화여자대학교 대학원	-
dc.subject	knapsack	-
dc.subject	problem	-
dc.subject	인테거프로그래밍	-
dc.title	A note on knapsack problem	-
dc.type	Master's Thesis	-
dc.format.page	iii, 14 p.	-
dc.identifier.thesisdegree	Master	-
dc.identifier.major	대학원 수학과	-
dc.date.awarded	1989. 2	-