Modern Cryptography 2020
DOI: 10.1007/978-3-030-63115-4_1
|View full text |Cite
|
Sign up to set email alerts
|

History of Cryptography to the 1800s

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3

Citation Types

0
4
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
4

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(4 citation statements)
references
References 1 publication
0
4
0
Order By: Relevance
“…38 For asymmetric cryptography, a pair of public and secret keys is required. 5,6 Our PUF key has a good performance in terms of randomness, uniformity, and uniqueness, promising to work as a highly trustworthy key in encryption due to its irreproducibility and true randomness. We can apply the Vernam algorithm (also known as a kind of stream cipher in symmetric cryptography) to encrypt and decrypt images.…”
Section: Resultsmentioning
confidence: 99%
See 3 more Smart Citations
“…38 For asymmetric cryptography, a pair of public and secret keys is required. 5,6 Our PUF key has a good performance in terms of randomness, uniformity, and uniqueness, promising to work as a highly trustworthy key in encryption due to its irreproducibility and true randomness. We can apply the Vernam algorithm (also known as a kind of stream cipher in symmetric cryptography) to encrypt and decrypt images.…”
Section: Resultsmentioning
confidence: 99%
“…We can apply the Vernam algorithm (also known as a kind of stream cipher in symmetric cryptography) to encrypt and decrypt images. 5,39 The detailed procedures are described in Section III in the Supporting Information. The exclusive OR (XOR) operation (as demonstrated in Section II in the Supporting Information) between information and the secured key will leak no information.…”
Section: Resultsmentioning
confidence: 99%
See 2 more Smart Citations