![Loading...](https://link.springer.com/static/c4a417b97a76cc2980e3c25e2271af3129e08bbe/images/pdf-preview/spacer.gif)
-
Article
Open AccessPseudorandom recursions II
We present our earlier results (not included in Hars and Petruska due to space and time limitations), as well as some updated versions of those, and a few more recent pseudorandom number generator designs. The...
-
Article
Open AccessRandom Number Generators in Secure Disk Drives
Cryptographic random number generators seeded by physical entropy sources are employed in many embedded security systems, including self-encrypting disk drives, being manufactured by the millions every year. R...
-
Article
Open AccessPseudorandom Recursions: Small and Fast Pseudorandom Number Generators for Embedded Applications
Many new small and fast pseudorandom number generators are presented, which pass the most common randomness tests. They perform only a few, nonmultiplicative operations for each generated number, use very litt...
-
Article
Open AccessApplications of Fast Truncated Multiplication in Cryptography
Truncated multiplications compute truncated products, contiguous subsequences of the digits of integer products. For an n-digit multiplication algorithm of time complexity O(nα), with 1<α≤2, there is a truncated...
-
Article
Open AccessModular Inverse Algorithms Without Multiplications for Cryptographic Applications
Hardware and algorithmic optimization techniques are presented to the left-shift, right-shift, and the traditional Euclidean-modular inverse algorithms. Theoretical arguments and extensive simulations determin...
-
Chapter and Conference Paper
Fast Truncated Multiplication for Cryptographic Applications
The Truncated Multiplication computes a truncated product, a contiguous subsequence of the digits of the product of 2 integers. A few truncated polynomial multiplication algorithms are presented and adapted to in...
-
Chapter and Conference Paper
Long Modular Multiplication for Cryptographic Applications
A digit-serial, multiplier-accumulator based cryptographic co-processor architecture is proposed, similar to fix-point DSP’s with enhancements, supporting long modular arithmetic and general computations. Seve...
-
Chapter and Conference Paper
Design and Implementation of a True Random Number Generator Based on Digital Circuit Artifacts
There are many applications for true, unpredictable random numbers. For example the strength of numerous cryptographic operations is often dependent on a source of truly random numbers. Sources of random infor...