bug-hurd
[Top][All Lists]
Advanced

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Re: [address@hidden: Help with entropy?]


From: Thomas Schwinge
Subject: Re: [address@hidden: Help with entropy?]
Date: Wed, 20 Jun 2007 23:31:44 +0200
User-agent: Mutt/1.5.11

Hello!

I just browsed (a bit) through tschwinge's Sammelsurium and found the
following links and things which may be interesting for you:
<http://download.ibofobi.dk/hurd-entropy/gnumach-entropy.diff.bz2>.
Furthermore, I also have an mbox file with 166 old emails of discussions
on Hurd mailing lists, emails about gathering entropy in the kernel and
translators for `/dev/{,u}random', as well as source code for some
translators.  I think I can publish that stuff somewhere.


From: Michael Casadevall <sonicmctails@gmail.com>
> My problem is when the buffer  
> is completely drained (like when I use GPG to generate a key), it  
> fails to refill.

Has this problem been resolved now?  As a test case I wouldn't use `gpg',
but a simple ``od --width=1 -t x1 < /dev/entropy''.


| Index: i386/i386at/conf.c

| + extern int  entropyopen(), entropyclose(), entropyread(), entropygetstat();

Just include <device/entropy.h> instead.


| Index: linux/configfrag.ac

| +     [if [ x"$enable_kmsg" != xno ]; then]

s/kmsg/entropy


| entropy.h

| #define ENTROPYBUFSIZE sizeof(unsigned long)*128 

Should this really be defined in here?  I'd put it into `entropy.c', as
the buffer size is internal business and is of no interest to the user of
the entropy device interface.

| /* typedef struct {
|   unsigned long ticks;
|   int data;
| } entropy_data; */

Likewise.


| entropy.c

| /*
|  * Mach Kernel - Entropy Generating Device
|  * Copyright (C) 2007 Free Software Foundation.

Did you originally copy this file from `device/kmsg.c'?  If yes, then you
should retain the original copyright lines.

| /*
|  * The following is from linux's random.c, and is used
|  * under the GPL
|  *
|  * Look there for a full explination on what these numbers
|  * mean and how this works
|  */
| 
| static struct poolinfo {
|       int poolwords;
|       int tap1, tap2, tap3, tap4, tap5;
|   } poolinfo_table [] = {
|     /* x^128 + x^103 + x^76 + x^51 +x^25 + x + 1 -- 105 */
|     { 128,    103,    76,     51,     25,     1 },

(Used in `entropy_putchar'.)  Albeit impressive, why do we want to have
this machinery inside the kernel?  Can't we put that into userspace and
have the kernel just export the raw entropy bits we gather from devices
or interrupts?

| io_return_t entropyopen(dev_t dev, int flag, io_req_t ior) {
|  /* Lock the function so we don't get a race condition */
|   simple_lock(&entropy_lock);
| 
|   /* Check to see if we've initalized entropy */
|   if(entropy_init_done == 0) {
|         entropyinit();
|   }
| 
|   entropy_in_use = 1;
| 
|   /* We're done, unlock, and return success */
|   simple_unlock(&entropy_lock);
|   return D_SUCCESS;
| }

You're allowing for more then one user of the `entropy' device.  Is this
intentional?  As soon as we have real translators sitting on
`/dev/{,u}random' / `/dev/entropy' it isn't anymore, I think.

| void entropy_putchar(int c) {

|   /* Its possible we MIGHT get here before the device is opened */
|   /* so just make sure we're initalized before doing anythign!  */
| 
|   if(!entropy_init_done) {
|     entropyinit();
|   }

As this will definitely happen as soon as the first interrupt occurs (or
whatever), why not just avoid this
calling-`entropyinit'-if-not-already-done dance which is used all over
the place and just call the function once, soon enough?  ``Soon enough''
may be difficult (or impossible?), but I'd nevertheless just call it once
and then have at this place here just a ``if (! entropy_init_done)
return;'' instead.


I did not yet check your ring-buffering magic (the thing Olaf pointed out
in his email, for example); I'll do that as soon as you say that your
code is ready for inclusion.


Regards,
 Thomas

Attachment: signature.asc
Description: Digital signature


reply via email to

[Prev in Thread] Current Thread [Next in Thread]