Sciweavers

1632 search results - page 29 / 327
» On special numberings of hypergraphs
Sort
View
ARITH
2001
IEEE
15 years 9 months ago
The Use of the Multi-Dimensional Logarithmic Number System in DSP Applications
A recently introduced double-base number representation has proved to be successful in optimizing the performance of several algorithms in cryptography and digital signal processi...
Vassil S. Dimitrov, Jonathan Eskritt, Laurent Imbe...
CSL
2008
Springer
15 years 8 months ago
Proving Infinitude of Prime Numbers Using Binomial Coefficients
We study the problem of proving in weak theories of Bounded Arithmetic the theorem that there are arbitrarily large prime numbers. We show that the theorem can be proved by some &...
Phuong Nguyen
ASIACRYPT
1999
Springer
15 years 10 months ago
How to Prove That a Committed Number Is Prime
Abstract. The problem of proving a number is of a given arithmetic format with some prime elements, is raised in RSA undeniable signature, group signature and many other cryptograp...
Tri Van Le, Khanh Quoc Nguyen, Vijay Varadharajan
CSC
2006
15 years 7 months ago
Parallel Computations Reveal Hidden Errors of Commonly Used Random Number Generators
This paper reports that in parallel Monte-Carlo simulations of the 2D Ising-Model, commonly used pseudo-random number generators (PRNG) lead to manifestly erroneous results. When ...
Hyo Ashihara, Ai Kuramoto, Isaku Wada, Makoto Mats...
FFA
2010
159views more  FFA 2010»
15 years 3 months ago
Parity of the number of irreducible factors for composite polynomials
Various results on parity of the number of irreducible factors of given polynomials over finite fields have been obtained in the recent literature. Those are mainly based on Swan&...
Ryul Kim, Wolfram Koepf