2014 International Conference on Advances in Computing, Communications and Informatics (ICACCI) 2014
DOI: 10.1109/icacci.2014.6968290
|View full text |Cite
|
Sign up to set email alerts
|

FPGA implementation of stream cipher using Toeplitz Hash function

Abstract: Hardware efficient stream ciphers and hash functions are widely used in cryptographic applications. The onewayness and low hardware complexity of hash function make it a good candidate for authentication operation of crypto-systems. On the other hand, stream ciphers are being widely used in the domain of cryptology. Generally, these stream ciphers use static key stream for the crypto process. In this work, we propose a hash function based key generator and integrate the hash function based key generation with … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2015
2015
2020
2020

Publication Types

Select...
2
2
1

Relationship

1
4

Authors

Journals

citations
Cited by 7 publications
(2 citation statements)
references
References 10 publications
0
2
0
Order By: Relevance
“…Zheng et al [24] propose a QRNG based on vacuum-fluctuation observations, which can reach output speed of 6 Gb/s of reliably random values. This device relies on Field-Programmable-Gate-Array (FPGA) implemented Toeplitz hashing [25] to achieve high-speed, real-time post-processing. Zheng et al state that their generator has a theoretical maximum speed of 12 Gb/s, but that information-theoretic randomness is only achievable at speed of 6 Gb/s.…”
Section: Hurley-smith and Hernandez-castromentioning
confidence: 99%
“…Zheng et al [24] propose a QRNG based on vacuum-fluctuation observations, which can reach output speed of 6 Gb/s of reliably random values. This device relies on Field-Programmable-Gate-Array (FPGA) implemented Toeplitz hashing [25] to achieve high-speed, real-time post-processing. Zheng et al state that their generator has a theoretical maximum speed of 12 Gb/s, but that information-theoretic randomness is only achievable at speed of 6 Gb/s.…”
Section: Hurley-smith and Hernandez-castromentioning
confidence: 99%
“…The Toeplitz matrix has the characteristic property, by which each binary value of matrix column in the Toeplitz matrix is attained by accumulation new binary value to the initial value of the column and moving the values down to the preceding column . Thus, in the Toeplitz matrix, each of the following element of matrix column represents the next stages in feedback shift register of linear type.…”
Section: Proposed Dynamic Hash Key‐based Stream Cipher and Crypto Systemmentioning
confidence: 99%