Paper 2006/232

Improvement to AKS algorithm

Roman Popovych

Abstract

We propose to verify the AKS algorithm identities not for sequential integers, but for integers which are sequentially squared. In that case a number of elements, for which the identities are valid, doubles.

Metadata
Available format(s)
PDF
Category
Public-key cryptography
Publication info
Published elsewhere. Unknown where it was published
Keywords
primality testing
Contact author(s)
popovych @ polynet lviv ua
History
2006-07-13: received
Short URL
https://ia.cr/2006/232
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2006/232,
      author = {Roman Popovych},
      title = {Improvement to AKS algorithm},
      howpublished = {Cryptology ePrint Archive, Paper 2006/232},
      year = {2006},
      note = {\url{https://eprint.iacr.org/2006/232}},
      url = {https://eprint.iacr.org/2006/232}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.