发明名称 Polynomial time deterministic method for testing primality of numbers
摘要 A method and system for generating prime numbers and testing for primality of an integer. This invention has applicability to "public key" and other encryption techniques that play an important role in the security of information technology and electronic commerce. Generation of prime numbers requires the step of testing the pnmality. The method includes a deterministic test for testing the primality of a number in polynomial time. The system includes a random number generator and a primality tester. The random number generator generates a random number and the primality tester tests the primality of this random number. The primality tester can also be used independent of the random number generator. In such a case, the number whose primality is to be tested can be input via a user interface.
申请公布号 US7346637(B2) 申请公布日期 2008.03.18
申请号 US20030631346 申请日期 2003.07.31
申请人 INDIAN INSTITUTE OF TECHNOLOGY 发明人 AGRAWAL MANINDRA;KAYAL NEERAJ;SAXENA NITIN
分类号 G06F15/00;G06F7/00;G06F7/72;H04L9/30 主分类号 G06F15/00
代理机构 代理人
主权项
地址