http://www.nnseek.com/e/sci.crypt.random-numbers/ Posts for sci.crypt.random-numbers Fri, 19 Jan 2007 01:01:27 PST http://www.nnseek.com/ http://www.nnseek.com/img/64.png 64 64 NNSeek http://www.nnseek.com/e/sci.crypt.random-numbers/call_for_papers_worldcomp_07_conferences_in_computer_72339225t.html http://www.nnseek.com/e/sci.crypt.random-numbers/call_for_papers_worldcomp_07_conferences_in_computer_72339225t.html Call for Papers

The 2007 World Congress in Computer Science,
Computer Engineering, and Applied Computing
WORLDCOMP'07
(composed of 24 Joint Conferences)
June 25-28, 2007, Las Vegas, USA

Dear Colleagues:

You are invited to submit a draft/full paper. All accepted papers will

be published in the respective conference proceedings. The academic
co-sponsors of WORLDCOMP'07 include: MIT Media Lab, MIT; Harvard
University's Statistical Genomics and Computational Biology Lab; Texas
Advanced Computing Center, The University of Texas at Austin;
Statistical
and Computational Intelligence Lab of Purdue University; University of
Iowa's Medical Imaging HPC Lab., and Institute for Informatics Problems
of the Russian Academy of Sciences, Moscow, Russia. A more complete
list of sponsors can be found below.

The 2007 World Congress in Computer Science, Computer Engineering,
and Applied Computing (WORLDCOMP'07) is composed of the following
24 conferences (all will be held simultaneously, same location
and dates: June 25-28, 2007, USA).

o The 2007 International Conference on Parallel and Distributed
Processing Techniques and Applications (PDPTA'07)

o The 2007 International Conference on Grid Computing and
Applications (GCA'07)

o The 2007 International Conference on Computer Design (CDES'07)

o The 2007 International Conference on Scientific Computing (CSC'07)

o The 2007 International Conference on Artificial Intelligence
(ICAI'07)

o The 2007 International Conference on Genetic and Evolutionary
Methods (GEM'07)

o The 2007 International Conference on Bioinformatics and
Computational Biology (BIOCOMP'07)

o The 2007 International Conference on Software Engineering Research
and Practice (SERP'07)

o The 2007 International Conference on Wireless Networks (ICWN'07)

o The 2007 International Conference on Image Processing, Computer
Vision, and Pattern Recognition (IPCV'07)

o The 2007 International Conference on Modeling, Simulation and
Visualization Methods (MSV'07)

o The 2007 International Conference on Computer Graphics and Virtual
Reality (CGVR'07)

o The 2007 International Conference on Multimedia Systems and
Applications (MSA'07)

o The 2007 International Conference on Internet Computing (ICOMP'07)

o The 2007 International Conference on Semantic Web and Web Services
(SWWS'07)

o The 2007 International Conference on Security and Management (SAM'07)

o The 2007 International Conference on Data Mining (DMIN'07)

o The 2007 International Conference on Information and Knowledge
Engineering (IKE'07)

o The 2007 International Conference on e-Learning, e-Business,
Enterprise Information Systems, and e-Government (EEE'07)

o The 2007 International Conference on Embedded Systems and
Applications (ESA'07)

o The 2007 International Conference on Frontiers in Education: Computer
Science and Computer Engineering (FECS'07)

o The 2007 International Conference on Foundations of Computer
Science (FCS'07)

o The 2007 International Conference on Engineering of Reconfigurable
Systems and Algorithms (ERSA'07)

o The 2007 International Conference on Communications in Computing
(CIC'7)

(a link to each conference's URL can be found at
http://www.worldacademyofscience.org/worldcomp07)

General Chair:

H. R. Arabnia, PhD
Professor, Computer Science
Editor-in-Chief, The Journal of Supercomputing (Springer)
The University of Georgia
Department of Computer Science
415 Graduate Studies Research Center
Athens, Georgia 30602-7404, USA
email: hra@cs.uga.edu

Purpose / History:

This set of joint conferences is the largest annual gathering of
researchers in computer science, computer engineering and applied
computing. Many of the 24 joint conferences in WORLDCOMP are the
premier conferences for presentation of advances in their respective
fields. Most of these conferences have been evaluated and
determined
to be top tier research conferences
(see http://www.cs-conference-ranking.org/index.html for an
example).
We anticipate to have 2000 or more attendees from over 75 countries
participating in the 2007 joint conferences.

The motivation is to assemble a spectrum of affiliated research
conferences into a coordinated research meeting held in a common
place at a common time. The main goal is to provide a forum for
exchange of ideas in a number of research areas that interact. The
model used to form these annual conferences facilitates
communication
among researchers from all over the world in different fields of
computer science, computer engineering and applied computing. Both
inward research (core areas of computer science and engineering) and
outward research (multi-disciplinary, inter-disciplinary, and
applications) will be covered during the conferences.

Submission of Papers:

Prospective authors are invited to submit their draft/full paper
(about 5 to 8 pages - single space, font size of 10 to 12) to
H. R. Arabnia by Feb. 20, 2007. E-mail submissions in MS document or
PDF formats are preferable (Fax or postal submissions are also
fine.)
All reasonable typesetting formats are acceptable (later, the
authors
of accepted papers will be asked to follow a particular typesetting
format to prepare their papers for publication.)

The length of the Camera-Ready papers (if accepted) will be limited
to
7 (IEEE style) pages. Papers must not have been previously
published
or currently submitted for publication elsewhere. The first page of
the draft paper should include: title of the paper, name,
affiliation,
postal address, email address, and telephone number for each author.
The first page should also identify the name of the author who will
be presenting the paper (if accepted) and a maximum of 5 topical
keywords that would best represent the content of the paper.
Finally,
the name of the conference that the paper is being submitted to must
be
stated on the first page.

Papers will be evaluated for originality, significance, clarity,
impact,
and soundness. Each paper will be refereed by two experts in the
field
who are independent of the conference program committee. The
referees'
evaluations will then be reviewed by two members of the program
committee who will recommend a decision to the chair of the track
that
the paper has been submitted to. The chair will make the final
decision.
Lastly, the Camera-Ready papers will be reviewed by one member of
the
program committee.

Members of Program and Organizing Committees:

The Program Committee includes members of chapters of World Academy
of Science (chapters: supercomputing; scientific computing;
artificial
intelligence; imaging science; databases; simulation; software
engineering; embedded systems; internet and web technologies;
communications; computer security; and bioinformatics.) The Program
Committee for individual conferences is currently being compiled.
Those
interested in joining the Program Committee should email H. R.
Arabnia
(hra@cs.uga.edu) the following information: Name, affiliation and
position, complete mailing address, email address, tel/fax numbers,
a short biography together with research interests and the name of
the conference offering to help with.

Location of Conferences:

The conferences will be held in the Monte Carlo Resort hotel, Las
Vegas,
Nevada, USA (with any overflows at other near-by hotels). The Monte
Carlo Resort is a mega hotel with excellent conference facilities
and
over 3,000 rooms. The hotel is minutes from the airport with
24-hour
shuttle service to and from the airport. This hotel has many
recreational attractions, including: waterfalls, spa, pools, sunning
decks, Easy River water ride, wave pool, lighted tennis courts,
health spa (with workout equipment, whirlpool, sauna, ...),
nightly shows, snack bars, many restaurants, shopping area, bars,
...
Many of these attractions are open 24 hours a day and most are
suitable
for families and children. The negotiated room rate for conference
attendees is very reasonable. The hotel is within walking distance
from most other attractions (major shopping areas, night clubs, free
street shows, Golf courses, ...).

Co-Sponsors (this is a partial list):

Academic Co-Sponsors of WORLDCOMP'07 include:
- Massachusetts Institute of Technology (MIT) Media Laboratory,
MIT (Cambridge, Massachusetts)
- Statistical Genomics and Computational Biology Laboratory,
Department of Statistics, Harvard University (Cambridge,
Massachusetts)
- Texas Advanced Computing Center, The University of Texas at
Austin (Austin, Texas)
- Statistical and Computational Intelligence Laboratory of
Purdue University (West Lafayette, Indiana)
- University of Iowa's Medical Imaging HPC Lab (Iowa City, Iowa)
- Institute for Informatics Problems of the Russian Academy of
Sciences, Moscow, Russia);
Other Co-sponsors include:
- HPCwire
- GRIDtoday
- STEM Education Society
- HPCSoft, HPC Software Inc.
- International Technology Institute (ITI)
- H2cM - Hodges' Health, UK

Important Dates:

Feb. 20, 2007: Submission of full/draft papers (about 5 to 8
pages)
March 20, 2007: Notification of acceptance
April 20, 2007: Camera-Ready papers and Registration due
June 25-28, 2007: The 2007 World Congress in Computer Science,
Computer Engineering, and Applied Computing
(WORLDCOMP'07 - 24 joint conferences)

Posted In: sci.crypt.random-numbers

no comments

Reply

]]> Fri, 19 Jan 2007 01:01:27 PST http://www.nnseek.com/e/sci.crypt.random-numbers/random_number_generation_using_a_256_state_cellular_68573209t.html http://www.nnseek.com/e/sci.crypt.random-numbers/random_number_generation_using_a_256_state_cellular_68573209t.html

I developed a 256-state cellular automaton that serves as a random
number generator. It's more than three times faster than the GNU
Scientific Library RNGs I tested (taus, gfsr4, mt19937, and ranlxd1)
and scores very well on the Diehard tests.


It's fast because the algorithm is basically an array lookup with
pointer value updates.


Alas, there is no proof about cycles or such, but the statistical
results so far are very good. Enjoy.


Code and results are here:


http://home.southernct.edu/~pasqualonia1/ca/report.html


Tony Pasqualoni

Posted In: sci.crypt.random-numbers

3 Comments

Reply

]]> Mon, 15 Jan 2007 06:37:30 PST http://www.nnseek.com/e/sci.crypt.random-numbers/current_favorite_generator_68208921t.html http://www.nnseek.com/e/sci.crypt.random-numbers/current_favorite_generator_68208921t.html > John Blackman has a test ("nda", it measures gaps between pairs of
> four-bit chunks) that found bias in this generator after about 1 GBytes.

"nda" or "dna"? Do you have a link for that test?

Cristiano

Posted In: sci.crypt.random-numbers

no comments

Reply

]]> Sat, 13 Jan 2007 02:45:48 PST http://www.nnseek.com/e/sci.crypt.random-numbers/true_real_number_generator_72337689t.html http://www.nnseek.com/e/sci.crypt.random-numbers/true_real_number_generator_72337689t.html Does anyone think a geiger (radiation) based
real number generator would be of interest ?
We are developing a small battery powered
unit for a project and may market it to the public
if it is viable.

Posted In: sci.crypt.random-numbers

2 Comments

Reply

]]> Wed, 03 Jan 2007 23:22:18 PST http://www.nnseek.com/e/sci.crypt.random-numbers/indium_real_random_number_generator_66275353t.html http://www.nnseek.com/e/sci.crypt.random-numbers/indium_real_random_number_generator_66275353t.html
I'm new to your group so I thought I would drop you a note and Let you
know about
a new real random number generator I have written called Indium.

It is a real random number generator not a pseduo-random one. It was
written in C
and I have placed all 900+ C functions inot the public domain. As a
open source
project I used every major encryption algorithm, one way hash function
and hundreds
more that I could find into it. Because of it's size and complexity it
is very sloooow
but the numbers it generates should be about as good as you can get.

I have incorporated Indium into a equally large encryption program I
call Vegas Vault.

If your interested in checking out either program the web site address
is:

www.sincitysoftware.serverheaven.net

Both programs are open source and freeware. Enjoy!

Cheers.........Ken

Posted In: sci.crypt.random-numbers

3 Comments

Reply

]]> Sat, 30 Dec 2006 17:04:53 PST http://www.nnseek.com/e/sci.crypt.random-numbers/bbc_links_privacy_concerns_over_states_corporations_24771097t.html http://www.nnseek.com/e/sci.crypt.random-numbers/bbc_links_privacy_concerns_over_states_corporations_24771097t.html The BBC news articles below address privacy concerns
over states' and corporations' use of personal data.
I think you will find the links useful.

Thanks,
Mashi

The basic summary is the following:
1. States collect personal info by various methods
(eg:CCTV/closed-circuit TV in roadways).
Corporations collect personal info by various means
(eg:credit card transactions).
2. The info collected by a single entity
(state/corporation) is considered
SEPERATELY BY ITSELF. The combination of
data collected by different entities is NOT
considered by many people.
3. Corporations are now building their businesses
by DATA MINING on previous customer interactions with them.
This is common practice.
4. If there are no safeguards to prevent corporations
from **SHARING** personal info with other corporations/state,
then IN THE FUTURE, an ECONOMY based on personal info
will come up (eg: a business targets only rich customers
based on info obtained from their bank records, insurance
companies may turn down requests based on info obtained
from health services etc).
5. If there are no safeguards to prevent state agencies
from **SHARING** personal info with other state
agencies/corporations, it could lead to SOCIAL DISCRIMINATION.
(eg: Traffic police may stop cars to do checks based on
info obtained from other state agencies regarding race of
the driver of car. ie. linking number plate to name, name to race,
and race to probability of person committing a crime).
6. Different ways outlined are CCTV(closed-circuit TV), number
plate recognition, shop RFID, mobile phone triangulation, store
loyalty cards, credit card transactions, electoral rolls,
health service records, TV preferences recording, worker
monitoring etc
Although some of them apply to only DEVELOPED COUNTRIES
(like CCTV), many could also apply to DEVELOPING COUNTRIES
(like credit card transactions, mobile phones).
7. Concerns outlined are
a. loss of privacy
b. loss of choice/consent by consumers
c. discrimination
8. IN THE FUTURE, when RFID (radio-frequence ID) tags become
cheap, they could create 'AN INTERNET OF THINGS'.
9. There are great risks if the info contained in the databases
are wrong/inaccurate or if it falls into wrong hands.

*How we are being watched -
http://news.bbc.co.uk/2/hi/uk_news/6110866.stm
*Britain is 'surveillance society' -
http://news.bbc.co.uk/2/hi/uk_news/6108496.stm
*Q&A: Radio-frequency ID tags -
http://news.bbc.co.uk/2/hi/technology/6055296.stm
*Trust warning over personal data -
http://news.bbc.co.uk/2/hi/uk_news/politics/5172890.stm
*Is business the real Big Brother? -
http://news.bbc.co.uk/2/hi/business/5015826.stm

Thanks,
Mashi

Posted In: sci.crypt.random-numbers

no comments

Reply

]]> Sat, 23 Dec 2006 00:20:56 PST http://www.nnseek.com/e/sci.crypt.random-numbers/current_favorite_generator_27492889t.html http://www.nnseek.com/e/sci.crypt.random-numbers/current_favorite_generator_27492889t.html generator for statistical purposes:

typedef unsigned long int u4;
typedef struct randctx { u4 a; u4 b; u4 c; u4 d; } randctx;

u4 rand( randctx *x ) {
u4 e = x->a;
x->a = x->b;
x->b = (x->c<<19) + (x->c>>13) + x->d;
x->c = x->d ^ x->a;
x->d = e + x->b;
return x->c;
}

It's not cryptographically secure. It can't cope with an all-zero
state. Short cycles are not impossible, though I've never found one.
I typically seed it by initializing x->a = x->b = x->c = x->d = seed,
then call rand() ten times. The things in its favor are it's small,
it's fast, it's well distributed, and its average cycle length is
2^^127 results. It passes DIEHARD. It passes uniformity, gap, and run
tests for at least 32G results (that's as far as I ran them). This
generator is about the same as a possibly cryptographic generator I
posted in 2002, except with the array x->a scaled down to 1 element.

Posted In: sci.crypt.random-numbers

7 Comments

Reply

]]> Wed, 13 Dec 2006 12:23:22 PST http://www.nnseek.com/e/sci.crypt.random-numbers/predicting_the_output_of_a_random_generator_21509401t.html http://www.nnseek.com/e/sci.crypt.random-numbers/predicting_the_output_of_a_random_generator_21509401t.html gmail.com> wrote:
>Kristian Gj

Posted In: sci.crypt.random-numbers

no comments

Reply

]]> Wed, 06 Dec 2006 08:39:45 PST http://www.nnseek.com/e/sci.crypt.random-numbers/predicting_the_output_of_a_random_generator_21411097t.html http://www.nnseek.com/e/sci.crypt.random-numbers/predicting_the_output_of_a_random_generator_21411097t.html gmail.com> wrote:
>Kristian Gj

Posted In: sci.crypt.random-numbers

2 Comments

Reply

]]> Wed, 06 Dec 2006 01:38:34 PST http://www.nnseek.com/e/sci.crypt.random-numbers/predicting_the_output_of_a_random_generator_21409817t.html http://www.nnseek.com/e/sci.crypt.random-numbers/predicting_the_output_of_a_random_generator_21409817t.html gmail.com> wrote in message
news:1165328330.989626.276950@80g2000cwy.googlegroups.com...
>> But if you
>> genuinely want your system analyzed for pay then I am available, and I
>> have
>> walked people through the entire process before, but no cryptanalyst
>> comes
>> cheap. I will spoil the ending for you though, your system will fail to
>> meet
>> the Information-Theoretic security goal you laid out.
>
> I can send you a file which is encoded with the FreeMove Quantum
> Exchange. I will pay you an amount on which we can agree in advance, if
> you send me the the decoded source file, including the method how you
> decoded the encoded source file, without having the private key.

You really should try reading what I write before you delete it:
> Now you are showing that you don't understand cryptography at all. Might I
> suggest reading some history surrounding the breaking of Enigma.

You should try understanding the realities of the situation before you go
proclaiming your ignorance.

>
>> To achieve that goal
>> requires a pre-existing secure channel that has at least the average
>> bandwidth of the active channel, even though the pre-existing secure
>> channel
>> may be highly bursty. Otherwise what you have is a stream cipher, which
>> while they can be cryptographically secure, they cannot be
>> information-theoretically secure without the pre-existing channel.
>
> I agree with you that public key systems can not be Information
> Theoretically secure. But the encoder and decoder of the FreeMove
> Quantum Exchange share in advance a private key, which gets refreshed
> once is has been used, by using part of the source channel capacity for
> communication of this new private key.

And there it is, right there, did you miss it? You just admitted it is not
information-theoretically secure. FreeMove's claim of information theoretic
security violates the fundamental principle that the pre-existing secure
channel MUST be at least as capacious as the communications channel. Your
sub-channel occupies part of the communications channel, so it cannot
provide more capacity than the communications channel. Since you also send
data over the communications channel, the sub-channel MUST be lower capacity
than the communications channel and therefore FreeMove cannot be information
theoretic secure.

So to recap, you have admitted that it is not information theoretic secure.


> The FreeMove Quantum Exchange functions which use fixed / mobile
> classical infrastructure as a communication channel, use quantum noise
> as the host data set in which source data is embedded.

So in short FreeMove uses quantum phenomena to generate random numbers. This
has nothing to do with the exchange.

I love this statement, it really is quite funny if you actually understand
the physics involved:
> Cloning is only possible with photons which have to be
> communicated over an optical communication infrastructure.

Joe

Posted In: sci.crypt.random-numbers

no comments

Reply

]]> Wed, 06 Dec 2006 01:31:19 PST