510.5+681.3The properties of the class of information-lossless automata represented by recurrent relations over a finite ring are investigated. For these automata, the structure of classes of equivalent states is investigated, problems of parametric identification and identification of the initial state are solved, and the variation in the behavior of such automata as a result of variation of their parameters or initial states is characterized.
A general scheme is investigated that is destined for obtaining estimates based on the cardinality of subsets of a fixed set of automata over some finite commutative-associative ring with unit element. A scheme is proposed to solve parametric systems of polynomial equations based on classes of associated elements of the ring. Some general characteristics of automata over the ring are established.
Исследуется вычислительная стойкость квантового протокола передачи ключа в предположении, что криптоаналитик управляет вероятностями выбора базисных векторов для измерения кубита, а также одновременным изменением базисов отправителя и адресата.Ключевые слова: квантовая криптография, криптоанализ, активная атака, квантовый протокол передачи ключа.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.