2017
DOI: 10.17586/2220-8054-2017-8-5-600-605
|View full text |Cite
|
Sign up to set email alerts
|

Random number generator for cryptography

Abstract: One key requirement for many cryptograhic schemes is the generation of random numbers. Sequences of random numbers are used at several stages of a standard cryptographic protocol. One simple example is a Vernam cipher, where a string of random numbers is added to message string to generate encrypted code. C = M ⊕ K. It has been mathematically shown that this simple scheme is unbreakable if key K is as long as M and is used only once. The security of a cryptosystem shall not be based on keeping the algorithm se… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
10
0

Year Published

2018
2018
2021
2021

Publication Types

Select...
4

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(10 citation statements)
references
References 20 publications
0
10
0
Order By: Relevance
“…But since the two distributions are not overlapping each other, an unambiguous bit designation can still be performed, which shows a higher tolerance for noise, as shown in our earlier work [11]. We have also shown in the earlier work that the measure of SOP obtained, is actually due to due to the ballistic and snake photons [13,14,11] whereas those that undergo significant depolarization cancel out each other. In this communication, we test this method with other polarizations, which will form components of a Quaternary encoding.…”
Section: Methodsmentioning
confidence: 54%
See 4 more Smart Citations
“…But since the two distributions are not overlapping each other, an unambiguous bit designation can still be performed, which shows a higher tolerance for noise, as shown in our earlier work [11]. We have also shown in the earlier work that the measure of SOP obtained, is actually due to due to the ballistic and snake photons [13,14,11] whereas those that undergo significant depolarization cancel out each other. In this communication, we test this method with other polarizations, which will form components of a Quaternary encoding.…”
Section: Methodsmentioning
confidence: 54%
“…In additon, as we show in this communication, the depolarization behaviour is different for different encodings, adding additional difficulty, which is peculiar to M-ary encodings. But our method of differential measurement, as shown earlier [11], will allow us to extract information with a near zero bit error rate despite a significant depolarization.…”
Section: Introductionmentioning
confidence: 89%
See 3 more Smart Citations