| Crypt :: ecdsa :: util. CRYPT :: ECDSA :: UTHIST´Â CRYPT :: ECDSA¸¦À§ÇÑ À¯Æ¿¸®Æ¼ ±â´ÉÀÌÀÖ´Â PERL ¸ðµâÀÔ´Ï´Ù. |
Áö±Ý ´Ù¿î·Îµå |
Crypt :: ecdsa :: util. ¼øÀ§ ¹× ¿ä¾à
- ƯÇã:
- Perl Artistic License
- °Ô½ÃÀÚ À̸§:
- William Herrera
- °Ô½ÃÀÚ À¥»çÀÌÆ®:
- http://search.cpan.org/~billh/
Crypt :: ecdsa :: util. ű×
Crypt :: ecdsa :: util. ¼³¸í
Crypt :: ECDSA :: UtilÀº Crypt :: ECDSA¸¦À§ÇÑ À¯Æ¿¸®Æ¼ ±â´ÉÀÌÀÖ´Â Perl ¸ðµâÀÔ´Ï´Ù. crypt :: ecdsa :: utilÀº crypt :: ecdsa.methodsbint bint ($ scalar)¸¦À§ÇÑ À¯Æ¿¸®Æ¼ ±â´ÉÀÌÀÖ´Â Perl ¸ðµâÀÔ´Ï´Ù. ´ëºÎºÐ ¼öÇÐÀ»À§ÇÑ ¹Ù·Î °¡±â :: GMPZ-> new (). Scalar Àμö ¶Ç´Â ´Ù¸¥ BigInt.two_POW¿¡¼ »õ·Î¿î ¼öÇÐ :: GMPZ À¯Çü BigInt ÀÓÀÇ Å©±âÀÇ Á¤¼ö¸¦ Scalar Àμö ¶Ç´Â ´Ù¸¥ $ 2_to_the_power_of_n = 2_POW ($ n); »õ·Î¿î bigint¸¦ 2 ** $ n.bigint_from_coeff¿Í °°½À´Ï´Ù. Irreducible = bigint_from_coeff (); => 2 ** 0 = 8 + 2 + 1is_probably_prime ³» $ is_prime = is_probably_prime ($ n); $ nÀÌ °ÅÀÇ È®½ÇÇÏ°Ô ÇÁ¶óÀÓ (chancemake_pq_seed_counter_new my ($ p, $ q, $ seed, $ counter) = make_pq_seed_counter_new (2048, 256, 256); L, NÀÌ ÁÖ¾îÁø DSA ¾Ë°í¸®Áò¿¡ »ç¿ëÇϱâ À§ÇØ PRIMES P ¹× Q¸¦ Á¦ÀÛÇϽʽÿÀ. ¾¾¾Ñ ±æÀÌ. FIPS PUB 186-3, 2006 (ÃÊ¾È Ç¥ÁØ) ÂüÁ¶ .MAKE_SEED_AND_PQ_WITH_SHA1 MY ($ P, $ Q, $ SEED, $ Ä«¿îÅÍ) = make_seed_and_pq_with_sha1 (1024, 164); DSA¿¡¼ »ç¿ëÇϱâ À§ÇØ PRIMES P ¹× Q¸¦ »ç¿ëÇϽʽÿÀ. L ¹× ½Ãµå ±æÀÌ°¡ ÁÖ¾îÁø ¾Ë°í¸®Áò. ÇöÀç Ç¥ÁØÀ» ÁÖ¾îÁÝ´Ï´Ù. ÇöÀç Ç¥ÁØÀ» ÂüÁ¶ÇϽʽÿÀ. ÀÌ°ÍÀº 2008 ³â ÀÌÈÄ¿¡ Æó±â µÉ ¼ö ÀÖ½À´Ï´Ù. ¡¤ Perl ¿ä±¸ »çÇ× : ¡¤ Perl.
Crypt :: ecdsa :: util. °ü·Ã ¼ÒÇÁÆ®¿þ¾î