Computer Science – Cryptography and Security
Scientific paper
2010-06-30
Computer Science
Cryptography and Security
Scientific paper
This article is meant to provide an additional point of view, applying known knowledge, to supply keys that have a series of non-repeating digits, in a manner that is not usually thought of. Traditionally, prime numbers are used in encryption as keys that have non-repeating sequences. Non-repetition of digits in a key is very sought after in encryption. Uniqueness in a digit sequence defeats decryption by method. In searching for methods of non-decryptable encryption as well as ways to provide unique sequences, other than using prime numbers, the idea of using repeating decimals came to me. Applied correctly, a repeating decimal series of sufficient length will stand in as well for a prime number. This is so, because only numbers prime to each other will produce repeating decimals and; within the repeating sequence there is uniqueness of digit sequence.
No associations
LandOfFree
Using Repeating Decimals As An Alternative To Prime Numbers In Encryption does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Using Repeating Decimals As An Alternative To Prime Numbers In Encryption, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Using Repeating Decimals As An Alternative To Prime Numbers In Encryption will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-154465