Re: [fpc-pascal] https support; call for testers

[sami]

2yf8lThanks, 

Let me learn more about server(and clients) certificates to try to not waste
your time with dummy questions, I'll try to study sample codes of others
open source web framework, i think it can help. 

See you later. 



--
View this message in context: 
http://free-pascal-general.1045716.n5.nabble.com/https-support-call-for-testers-tp5718919p5722467.html
Sent from the Free Pascal - General mailing list archive at Nabble.com.
___
fpc-pascal maillist  -  fpc-pascal@lists.freepascal.org
http://lists.freepascal.org/cgi-bin/mailman/listinfo/fpc-pascal

Re: [fpc-pascal] https support; call for testers

[Michael Van Canneyt]

On Thu, 27 Aug 2015, sami wrote:


leledumbo wrote

You can't yet, the support is still in fphttpclient only for now.


Can i implement it just like in fpHttpClient and upload a patch ?

or in server-side it is more complicated or have different approach than
client-side ?


You can try. But it is more complicated, since you will need to make provisions 
for adding a certificate.



In fact i trying to write a more complete server that can listen http and
https(keeping user sessions)
and more functions but i´m not too experienced in web programing and
concepts. 

Following this thread 
http://forum.lazarus.freepascal.org/index.php?topic=25433.0

  ,I could
write a server with a thread pool, 
that improved performance a lot. 


If someone interested i can share the code and contribute with some
functionality. 
but i need someone to guide my steps. starting with https support.


Ask questions, I will do my best to answer that.

Michael.___
fpc-pascal maillist  -  fpc-pascal@lists.freepascal.org
http://lists.freepascal.org/cgi-bin/mailman/listinfo/fpc-pascal

Re: [fpc-pascal] https support; call for testers

[sami]

leledumbo wrote
> You can't yet, the support is still in fphttpclient only for now.

Can i implement it just like in fpHttpClient and upload a patch ?

or in server-side it is more complicated or have different approach than
client-side ? 

In fact i trying to write a more complete server that can listen http and
https(keeping user sessions)
and more functions but i´m not too experienced in web programing and
concepts. 

Following this thread 
http://forum.lazarus.freepascal.org/index.php?topic=25433.0
  ,I could
write a server with a thread pool, 
that improved performance a lot. 

If someone interested i can share the code and contribute with some
functionality. 
but i need someone to guide my steps. starting with https support.

My final target is a Multi-tenancy server for a SaaS provider.  




--
View this message in context: 
http://free-pascal-general.1045716.n5.nabble.com/https-support-call-for-testers-tp5718919p5722465.html
Sent from the Free Pascal - General mailing list archive at Nabble.com.
___
fpc-pascal maillist  -  fpc-pascal@lists.freepascal.org
http://lists.freepascal.org/cgi-bin/mailman/listinfo/fpc-pascal

Re: [fpc-pascal] quality of FPC random

[Michael Schnell]

Thinking more about the issue:

As said, the quality of a random number generator is more a matter of 
taste than a subject to in-depth discussion (as nearly everything that 
is influenced by the way infinity word).


Obviously a perfect random number generator (for integer numbers 0...n) 
*needs *to be able to create a series of a million zeros. This is 
(seemingly) neither a nice Equal Distribution nor *obviously* unpredictable.




IMHO a very decent random generator is just the simple process

r(n) = x(n)   withx(n) = (a + b*x(n-1) ) mod c

Here c should be a (big) prime, as you will get "less random" sub-series 
of the length of any factor of c.


OK let a and b be big primes, as well. That does not harm.


Equal Distribution is granted, as the sequence will completely cover all 
the numbers 0..c-1 and then start from the beginning.


Of course it is perfectly predictable if you know the numbers a, b, and 
c. and I suppose you can detect them from watching the series for a 
rather short time.



You can reduce the predictability by doing a much smaller non-process 
from the big cyclic process


maybe just

r(n) = x(n) mod d  withx(n) = (a + b*x(n-1) ) mod c with d being a 
prime several orders of magnitude lower than c (and a and b)


could work (I did not try a proof or disproof). Maybe d needs not be a 
prime but just 2^n if you want an appropriately long key.


But for cryptology all this needs really large integer numbers. That 
should not be an unsolvable problem. Finding a really large Prime is a 
standard task, anyway.



Of course x(0) should be created using a nice entropy method.

-Michael
___
fpc-pascal maillist  -  fpc-pascal@lists.freepascal.org
http://lists.freepascal.org/cgi-bin/mailman/listinfo/fpc-pascal

Re: [fpc-pascal] FPC 3.0.0-rc1 release

[Mark Morgan Lloyd]

Martin Schreiber wrote:

On Wednesday 26 August 2015 20:14:09 Mark Morgan Lloyd wrote:

Is there a native ARM version compatible with the Raspberry Pi?


Here:
http://sourceforge.net/projects/mseide-msegui/files/fpcarm/

Please run eabihf/lib/fpc/3.0.1/samplecfg in order to create a default 
configuration file.


Cross development environment Linux X86 -> Raspberry Pi is here:
http://sourceforge.net/projects/mseide-msegui/files/fpcrossarm/crossfpc-i386_linux_eabihf_3_0_1.tar.gz/download

How cross development looks in MSEide:
http://mseide-msegui.sourceforge.net/pics/crossarm.png


Thanks Martin, I'll look at that.

--
Mark Morgan Lloyd
markMLl .AT. telemetry.co .DOT. uk

[Opinions above are the author's, not those of his employers or colleagues]
___
fpc-pascal maillist  -  fpc-pascal@lists.freepascal.org
http://lists.freepascal.org/cgi-bin/mailman/listinfo/fpc-pascal