Computational reduction of Wilson's primality test for modern cryptosystems.(Report): An article from: Informatica

This digital document is an article from Informatica, published by Slovenian Society Informatika on November 1, 2009. The length of the article is 4970 words. The page length shown above is based on a typical 300-word page. The article is delivered in HTML format and is available immediately after purchase. You can view it with any web browser.

Citation Details
Title: Computational reduction of Wilson's primality test for modern cryptosystems.(Report)
Author: Chia-Long Wu
Publication:Informatica (Magazine/Journal)
Date: November 1, 2009
Publisher: Slovenian Society Informatika
Volume: 33 Issue: 4 Page: 453(6)

Article Type: Report

Distributed by Gale, a part of Cengage Learning