|
|
Up |
|
|
  |
Author: Le Chaud LapinLe Chaud Lapin
Date: May 28, 2008 19:07
Hi All,
What are the prevaling recommendations for choosing p, q, such that
the product is indeed, say, 512 bits, for a 512-bit modulus.
There are things that can be done to the bit-pattern of p and q during
randomization phase obviously, and I recall a while back in Coutinho's
there was a recommendation, but I wanted to explore more.
TIA,
-Le Chaud Lapin-
|
| |
|
| |
41 Comments |
|
  |
Author: Bobo Bonobo®Bobo Bonobo®
Date: May 28, 2008 15:33
On May 28, 12:58Â pm, hamada gmail.com> wrote:
> [A bunch of off topic stuff]
|
| |
|
| |
1 Comment |
|
  |
Author: Don StockbauerDon Stockbauer
Date: May 28, 2008 11:58
Protection of Orphans and the Poor in the Qur'an
On May 28, 11:58 am, hamada gmail.com> wrote:
> The gab between the rich and the poor is widening. It is becoming a
> major issue of debate during our Presidential Elections, and certainly
> the most important iss.....
Is this a guarantee, or just words?
|
| |
|
1 Comment |
|
  |
|
|
  |
|
|
  |
Author: hamadahamada
Date: May 28, 2008 06:26
The most concise definition of God in Islam is given in the four
verses of Surah Ikhlas which is Chapter 112 of the Qur'an:
"Say: He is Allah,
The One and Only.
"Allah, the Eternal, Absolute.
"He begets not, nor is He begotten.
And there is none like unto Him."
[Al-Qur'an 112:1-4]
The word 'Assamad' is difficult to translate. It means 'absolute
existence', which can be attributed only to Allah (swt), all other
existence being temporal or conditional. It also means that Allah
(swt) is not dependant on any person or thing, but all persons and
things are dependant on Him.
Surah Ikhlas - the touchstone of theology:
|
| Show full article (26.61Kb) |
|
no comments
|
|
  |
|
|
  |
Author: Björn FayBjörn Fay
Date: May 28, 2008 03:48
I have read "Indifferentiability, Impossibility Results on Reductions, and Applications to the Random Oracle Methodology" by Maurer, Renner, and Holenstein. One Statement of them is that there is no reduction from Random Oracles to asynchronous beacons. I don't have the original paper from Rabin about beacons, but as far as I understand, is a "normal" beacon something that gives you let's say every second a random bit. In the paper from Maurer et al. they treat beacons as functions with runningtime x for input x, because we have to wait x seconds for the random bit (but they also say that the random bits are sequentially accessible, what I would understand as a "normal" beacon, as described before). So if they want the random bits 1, 2, and 3 they have to wait 1+2+3 = 6 seconds, where for "normal"...
|
| Show full article (1.63Kb) |
|
2 Comments |
|
|
|
|