{"action":"created","issue":{"url":"https://api.github.com/repos/openssl/openssl/issues/6012","repository_url":"https://api.github.com/repos/openssl/openssl","labels_url":"https://api.github.com/repos/openssl/openssl/issues/6012/labels{/name}","comments_url":"https://api.github.com/repos/openssl/openssl/issues/6012/comments","events_url":"https://api.github.com/repos/openssl/openssl/issues/6012/events","html_url":"https://github.com/openssl/openssl/issues/6012","id":315819442,"number":6012,"title":"Tighten the probality for being a prime","user":{"login":"AnnieYousar","id":18533636,"avatar_url":"https://avatars0.githubusercontent.com/u/18533636?v=4","gravatar_id":"","url":"https://api.github.com/users/AnnieYousar","html_url":"https://github.com/AnnieYousar","followers_url":"https://api.github.com/users/AnnieYousar/followers","following_url":"https://api.github.com/users/AnnieYousar/following{/other_user}","gists_url":"https://api.github.com/users/AnnieYousar/gists{/gist_id}","starred_url":"https://api.github.com/users/AnnieYousar/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/AnnieYousar/subscriptions","organizations_url":"https://api.github.com/users/AnnieYousar/orgs","repos_url":"https://api.github.com/users/AnnieYousar/repos","events_url":"https://api.github.com/users/AnnieYousar/events{/privacy}","received_events_url":"https://api.github.com/users/AnnieYousar/received_events","type":"User","site_admin":false},"labels":[],"state":"open","locked":false,"assignee":null,"assignees":[],"milestone":null,"comments":6,"created_at":"2018-04-19T10:31:33Z","updated_at":"2018-04-19T20:58:06Z","closed_at":null,"author_association":"NONE","body":"`include/openssl/bn.h`  sets an error rate of less than 2^-80 for random `b`-bit input, b >= 100.\r\nIt seems to be the time to recompute the table 4.4 in the Handbook of Applied Cryptography [Menezes, van Oorschot, Vanstone; CRC Press 1996] for an error rate of 2^-120.\r\nNote that there will be no changes for the number of prime checks for bit size greater than 2535, for lower bit sizes (but greater than 1000) at most three additional Rabin-Miller checks are sufficient. \r\nSuch an adjustment costs almost nothing (as it done only at the end of the pseudo prime check) but gives a better assurance."},"comment":{"url":"https://api.github.com/repos/openssl/openssl/issues/comments/382878582","html_url":"https://github.com/openssl/openssl/issues/6012#issuecomment-382878582","issue_url":"https://api.github.com/repos/openssl/openssl/issues/6012","id":382878582,"user":{"login":"AnnieYousar","id":18533636,"avatar_url":"https://avatars0.githubusercontent.com/u/18533636?v=4","gravatar_id":"","url":"https://api.github.com/users/AnnieYousar","html_url":"https://github.com/AnnieYousar","followers_url":"https://api.github.com/users/AnnieYousar/followers","following_url":"https://api.github.com/users/AnnieYousar/following{/other_user}","gists_url":"https://api.github.com/users/AnnieYousar/gists{/gist_id}","starred_url":"https://api.github.com/users/AnnieYousar/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/AnnieYousar/subscriptions","organizations_url":"https://api.github.com/users/AnnieYousar/orgs","repos_url":"https://api.github.com/users/AnnieYousar/repos","events_url":"https://api.github.com/users/AnnieYousar/events{/privacy}","received_events_url":"https://api.github.com/users/AnnieYousar/received_events","type":"User","site_admin":false},"created_at":"2018-04-19T20:58:06Z","updated_at":"2018-04-19T20:58:06Z","author_association":"NONE","body":"I read the chap. 4 of HAC: http://cacr.uwaterloo.ca/hac/about/chap4.pdf, which is referred by OpenSSL in `include/openssl/bn.h`. My target was only to re-calculate the table in line 106 - 130 for `BN_prime_checks`, based on a stronger probability assumption 2^-80 => 2^-120 with the means of HAC.  I've no ideas for changes in the prime search procedure `BN_generate_prime_ex`."}}
{"actor":{"display_login":"AnnieYousar"}}