A True random generator in FPGA for cryptographic applications

Yıldırım, Salih
In this thesis a True Random Number Generator (TRNG) employed for cryptographic applications is investigated, implemented and evaluated. The design of TRNG and its embedded tests are described in VHDL language and then implemented on an FPGA platform. Randomness is extracted from the jitter of ring oscillators that has self-failure detecting and sampling logic. The implementation needs only primitive resources which are common in all kinds of FPGAs. The embedded randomness tests described in Federal Information Processing Standard (FIPS) 140-1 are realized on FPGA. The statistical quality of the generated random bits is also confirmed by running the Diehard and NIST (National Institute of Standards and Technology) Test Suites seperately. The implemented TRNG has a throughput up to 0.5 Mbps and its core occupies only 25 slices of Xilinx Virtex-5 FPGA. This design demonstrates the possibility of generating and confirming true random bit sequences by using only the internal resources of FPGAs. The performance of our TRNG is also compared with a separate IC, RPG100 from FDK Corporation.


A low latency, high throughput and scalable hardware architecture for flow tables in software defined networks
Eral, Göksan; Schmidt, Şenan Ece; Department of Electrical and Electronics Engineering (2016)
Software Defined Networking (SDN) is a new paradigm which requires multi-field packet classification for each received packet by looking up Flow Tables which contain a large number of rules and corresponding actions. The rules are defined by upto 15 packet header fields including IP source and destination address. If more than one rule rule matches then the action of the highest priority rule is executed. Furthermore rules with wildcard fields are possible. The SDN Flow Table should scale with the rule coun...
OpenCL implementation of montgomery multiplication on FPGA /
Büyükşahin, Mehmet Ufuk; Bazlamaçcı, Cüneyt Fehmi; Department of Electrical and Electronics Engineering (2014)
Galois Field arithmetic has been used very frequently in popular security and errorcorrection applications. Montgomery multiplication is among the suitable methods used for accelerating modular multiplication, which is the most time consuming basic arithmetic operation. Montgomery multiplication is also suitable to be implemented in parallel. OpenCL, which is a portable, heterogeneous and parallel programming framework, is recently supported by a major FPGA vendor, Altera. Therefore it is now possible to ex...
A High throughput FPGA implementation of markov chain monte carlo method for mixture models
Bozgan, Caner; Ulusoy, İlkay; Department of Electrical and Electronics Engineering (2019)
Markov Chain Monte Carlo (MCMC) is a class of algorithms which can generate samples from high dimensional and multimodal probability distributions. In many statistical and control applications, MCMC algorithms are employed widely thanks to their ability to draw sample from arbitrary distribution regardless of dimension or complexity. However, as the complexity of the Bayesian models and the computational load of the MCMC algorithm increase, performing MCMC inference becomes impractical or too time consuming...
Computational platform for predicting lifetime system reliability profiles for different structure types in a network
Akgül, Ferhat (2004-01-01)
This paper presents a computational platform for predicting the lifetime system reliability profiles for different structure types located in an existing network. The computational platform has the capability to incorporate time-variant live load and resistance models. Following a review of the theoretical basis, the overall architecture of the computational platform is described. Finally, numerical examples of three existing bridges (i.e., a steel, a prestressed concrete, and a hybrid steel-concrete bridge...
A modified algorithm for peer-to-peer security
Akleylek, Sedat; Emmungil, Levent; NURİYEV, URFAT (2007-01-01)
In this paper we present the steganographic approach to peer-to-peer systems with a modified algorithm. This gives the user a very high level of protection against being compelled to disclose its contents. Even the realization of the quantum computer cannot solve NP-hard problem in a polynomial time, a modified algorithm with steganographic use depending on Knapsack problem may make peer-to-peer systems secure.
Citation Formats
S. Yıldırım, “A True random generator in FPGA for cryptographic applications,” M.S. - Master of Science, Middle East Technical University, 2012.