MERAL Myanmar Education Research and Learning Portal
Item
{"_buckets": {"deposit": "bdff5a1b-6e54-4660-88fc-b4f0c359d39e"}, "_deposit": {"id": "3396", "owners": [], "pid": {"revision_id": 0, "type": "recid", "value": "3396"}, "status": "published"}, "_oai": {"id": "oai:meral.edu.mm:recid/3396", "sets": ["user-ucsy"]}, "communities": ["ucsy"], "item_1583103067471": {"attribute_name": "Title", "attribute_value_mlt": [{"subitem_1551255647225": "Analysis of Pseudorandom Number Generator over Elliptic Curve", "subitem_1551255648112": "en"}]}, "item_1583103085720": {"attribute_name": "Description", "attribute_value_mlt": [{"interim": "Pseudorandom Number Generators (PRNGs) are computational algorithms that produce long sequence of random results, which are determined by a shorter initial seed or key. Elliptic curve cryptosystem is a public key cryptosystem. It is replacing with RSA in most of the cryptosystems because it has the same level of security with smaller key sizes. This system presents an extract of results taken from analyzing Nonlinear Filter Generator (NLFG) and Linear Congruential Generator (LCG) based on Elliptic Curves defined over prime fields. Randomness is a crucial resource for cryptography so outputs of these two algorithms are evaluated using statistical tests for randomness. This system will be implemented by using Visual C# programming language."}]}, "item_1583103108160": {"attribute_name": "Keywords", "attribute_value_mlt": [{"interim": "Pseudorandom number generators"}, {"interim": "Elliptic curve"}, {"interim": "Statistical tests"}]}, "item_1583103120197": {"attribute_name": "Files", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_access", "date": [{"dateType": "Available", "dateValue": "2019-07-22"}], "displaytype": "preview", "download_preview_message": "", "file_order": 0, "filename": "psc2010paper (212).pdf", "filesize": [{"value": "297 Kb"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_free", "mimetype": "application/pdf", "size": 297000.0, "url": {"url": "https://meral.edu.mm/record/3396/files/psc2010paper (212).pdf"}, "version_id": "b4edf3df-4c35-4f0d-818e-1cc1e2fd298b"}]}, "item_1583103131163": {"attribute_name": "Journal articles", "attribute_value_mlt": [{"subitem_issue": "", "subitem_journal_title": "Fifth Local Conference on Parallel and Soft Computing", "subitem_pages": "", "subitem_volume": ""}]}, "item_1583103147082": {"attribute_name": "Conference papers", "attribute_value_mlt": [{"subitem_acronym": "", "subitem_c_date": "", "subitem_conference_title": "", "subitem_part": "", "subitem_place": "", "subitem_session": "", "subitem_website": ""}]}, "item_1583103211336": {"attribute_name": "Books/reports/chapters", "attribute_value_mlt": [{"subitem_book_title": "", "subitem_isbn": "", "subitem_pages": "", "subitem_place": "", "subitem_publisher": ""}]}, "item_1583103233624": {"attribute_name": "Thesis/dissertations", "attribute_value_mlt": [{"subitem_awarding_university": "", "subitem_supervisor(s)": [{"subitem_supervisor": ""}]}]}, "item_1583105942107": {"attribute_name": "Authors", "attribute_value_mlt": [{"subitem_authors": [{"subitem_authors_fullname": "Myat, Yin Yin"}, {"subitem_authors_fullname": "Mon, Ohmmar Min"}]}]}, "item_1583108359239": {"attribute_name": "Upload type", "attribute_value_mlt": [{"interim": "Publication"}]}, "item_1583108428133": {"attribute_name": "Publication type", "attribute_value_mlt": [{"interim": "Article"}]}, "item_1583159729339": {"attribute_name": "Publication date", "attribute_value": "2010-12-16"}, "item_1583159847033": {"attribute_name": "Identifier", "attribute_value": "http://onlineresource.ucsy.edu.mm/handle/123456789/1151"}, "item_title": "Analysis of Pseudorandom Number Generator over Elliptic Curve", "item_type_id": "21", "owner": "1", "path": ["1597824273898"], "permalink_uri": "http://hdl.handle.net/20.500.12678/0000003396", "pubdate": {"attribute_name": "Deposited date", "attribute_value": "2019-07-22"}, "publish_date": "2019-07-22", "publish_status": "0", "recid": "3396", "relation": {}, "relation_version_is_last": true, "title": ["Analysis of Pseudorandom Number Generator over Elliptic Curve"], "weko_shared_id": -1}
Analysis of Pseudorandom Number Generator over Elliptic Curve
http://hdl.handle.net/20.500.12678/0000003396
http://hdl.handle.net/20.500.12678/0000003396c6883c65-448d-4fb4-b365-e36603fd9274
bdff5a1b-6e54-4660-88fc-b4f0c359d39e
Name / File | License | Actions |
---|---|---|
psc2010paper (212).pdf (297 Kb)
|
|
Publication type | ||||||
---|---|---|---|---|---|---|
Article | ||||||
Upload type | ||||||
Publication | ||||||
Title | ||||||
Title | Analysis of Pseudorandom Number Generator over Elliptic Curve | |||||
Language | en | |||||
Publication date | 2010-12-16 | |||||
Authors | ||||||
Myat, Yin Yin | ||||||
Mon, Ohmmar Min | ||||||
Description | ||||||
Pseudorandom Number Generators (PRNGs) are computational algorithms that produce long sequence of random results, which are determined by a shorter initial seed or key. Elliptic curve cryptosystem is a public key cryptosystem. It is replacing with RSA in most of the cryptosystems because it has the same level of security with smaller key sizes. This system presents an extract of results taken from analyzing Nonlinear Filter Generator (NLFG) and Linear Congruential Generator (LCG) based on Elliptic Curves defined over prime fields. Randomness is a crucial resource for cryptography so outputs of these two algorithms are evaluated using statistical tests for randomness. This system will be implemented by using Visual C# programming language. | ||||||
Keywords | ||||||
Pseudorandom number generators, Elliptic curve, Statistical tests | ||||||
Identifier | http://onlineresource.ucsy.edu.mm/handle/123456789/1151 | |||||
Journal articles | ||||||
Fifth Local Conference on Parallel and Soft Computing | ||||||
Conference papers | ||||||
Books/reports/chapters | ||||||
Thesis/dissertations |