A Novel Approach for Pseudo-Random Seed Generation

Random sequences play an important role in all aspects of Cryptography. All cryptographic systems and protocols are based on secrets and can only be as strong as the random sequence generators they use to generate those secrets. The best cryptographic scheme becomes insecure once its secrets can be predicted or determined. In modern cryptography random sequences are used (1) to generate session keys and initialization vectors for symmetric block ciphers, (2) to generate random values for various digital signature schemes such as DSA and (3) to produce seeds which are used in math routines to get values such as large prime numbers for RSA and also in security protocols. This paper presents the design of RAMG, a pseudorandom seed generator, using a secure symmetric block cipher algorithm. We describe the design principles used for the development of the generator as well as its principal components. We also discuss the idea of using it as a pseudo-random bit generator (DRBG).

Saved in:
Bibliographic Details
Main Authors: Pelaiz,Sacha, Tejera,Renier
Format: Digital revista
Language:English
Published: Instituto Politécnico Nacional, Centro de Investigación en Computación 2013
Online Access:http://www.scielo.org.mx/scielo.php?script=sci_arttext&pid=S1405-55462013000100007
Tags: Add Tag
No Tags, Be the first to tag this record!
id oai:scielo:S1405-55462013000100007
record_format ojs
spelling oai:scielo:S1405-554620130001000072013-06-11A Novel Approach for Pseudo-Random Seed GenerationPelaiz,SachaTejera,Renier DRGB seed symmetric encryption cipher Random sequences play an important role in all aspects of Cryptography. All cryptographic systems and protocols are based on secrets and can only be as strong as the random sequence generators they use to generate those secrets. The best cryptographic scheme becomes insecure once its secrets can be predicted or determined. In modern cryptography random sequences are used (1) to generate session keys and initialization vectors for symmetric block ciphers, (2) to generate random values for various digital signature schemes such as DSA and (3) to produce seeds which are used in math routines to get values such as large prime numbers for RSA and also in security protocols. This paper presents the design of RAMG, a pseudorandom seed generator, using a secure symmetric block cipher algorithm. We describe the design principles used for the development of the generator as well as its principal components. We also discuss the idea of using it as a pseudo-random bit generator (DRBG).info:eu-repo/semantics/openAccessInstituto Politécnico Nacional, Centro de Investigación en ComputaciónComputación y Sistemas v.17 n.1 20132013-03-01info:eu-repo/semantics/articletext/htmlhttp://www.scielo.org.mx/scielo.php?script=sci_arttext&pid=S1405-55462013000100007en
institution SCIELO
collection OJS
country México
countrycode MX
component Revista
access En linea
databasecode rev-scielo-mx
tag revista
region America del Norte
libraryname SciELO
language English
format Digital
author Pelaiz,Sacha
Tejera,Renier
spellingShingle Pelaiz,Sacha
Tejera,Renier
A Novel Approach for Pseudo-Random Seed Generation
author_facet Pelaiz,Sacha
Tejera,Renier
author_sort Pelaiz,Sacha
title A Novel Approach for Pseudo-Random Seed Generation
title_short A Novel Approach for Pseudo-Random Seed Generation
title_full A Novel Approach for Pseudo-Random Seed Generation
title_fullStr A Novel Approach for Pseudo-Random Seed Generation
title_full_unstemmed A Novel Approach for Pseudo-Random Seed Generation
title_sort novel approach for pseudo-random seed generation
description Random sequences play an important role in all aspects of Cryptography. All cryptographic systems and protocols are based on secrets and can only be as strong as the random sequence generators they use to generate those secrets. The best cryptographic scheme becomes insecure once its secrets can be predicted or determined. In modern cryptography random sequences are used (1) to generate session keys and initialization vectors for symmetric block ciphers, (2) to generate random values for various digital signature schemes such as DSA and (3) to produce seeds which are used in math routines to get values such as large prime numbers for RSA and also in security protocols. This paper presents the design of RAMG, a pseudorandom seed generator, using a secure symmetric block cipher algorithm. We describe the design principles used for the development of the generator as well as its principal components. We also discuss the idea of using it as a pseudo-random bit generator (DRBG).
publisher Instituto Politécnico Nacional, Centro de Investigación en Computación
publishDate 2013
url http://www.scielo.org.mx/scielo.php?script=sci_arttext&pid=S1405-55462013000100007
work_keys_str_mv AT pelaizsacha anovelapproachforpseudorandomseedgeneration
AT tejerarenier anovelapproachforpseudorandomseedgeneration
AT pelaizsacha novelapproachforpseudorandomseedgeneration
AT tejerarenier novelapproachforpseudorandomseedgeneration
_version_ 1756225742196178944