{"title":"非线性伪随机数发生器的线性复杂度与格检验","authors":"Domingo Gómez-Pérez, J. Gutierrez","doi":"10.1017/CBO9781139696456.006","DOIUrl":null,"url":null,"abstract":"One of the main contributions which Harald Niederreiter made to mathematics is related to pseudorandom sequences theory. In this paper we study several measures for asserting the quality of pseudorandom sequences, involving generalizations of linear complexity and lattice tests and relations between them.","PeriodicalId":352591,"journal":{"name":"Applied Algebra and Number Theory","volume":"47 5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"On the linear complexity and lattice test of nonlinear pseudorandom number generators\",\"authors\":\"Domingo Gómez-Pérez, J. Gutierrez\",\"doi\":\"10.1017/CBO9781139696456.006\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"One of the main contributions which Harald Niederreiter made to mathematics is related to pseudorandom sequences theory. In this paper we study several measures for asserting the quality of pseudorandom sequences, involving generalizations of linear complexity and lattice tests and relations between them.\",\"PeriodicalId\":352591,\"journal\":{\"name\":\"Applied Algebra and Number Theory\",\"volume\":\"47 5 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Applied Algebra and Number Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1017/CBO9781139696456.006\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Applied Algebra and Number Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1017/CBO9781139696456.006","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
On the linear complexity and lattice test of nonlinear pseudorandom number generators
One of the main contributions which Harald Niederreiter made to mathematics is related to pseudorandom sequences theory. In this paper we study several measures for asserting the quality of pseudorandom sequences, involving generalizations of linear complexity and lattice tests and relations between them.