Method for complex protection of information
FIELD: engineering of technical means for complex protection of information during its storage and transfer.
SUBSTANCE: method for complex information protection is realized in following order: prior to transfer into communication channel or prior to recording into memory, state of used communication channel or information storage environment is analyzed, from M possible codes parameters of optimal (n,k) code for current status of channel or information storage end are determined, information subject to protection is split on q-nary symbols l bits long (q=2l) for each q-nary system gamma combinations l bits long are formed independently from information source, for each set of k informational q-nary symbols (n-k) excessive q-nary symbols are formed in accordance to rules of source binary (n,k) code, each q-nary symbol is subjected to encrypting stochastic transformation with participation of gamma, after receipt from communication channel or after reading from memory for each q-nary symbol combination of gamma with length l is generated, synchronously with transferring side, reverse stochastic decrypting transformation is performed for each q-nary symbol with participation of gamma, by means of checking expressions of source binary code localized are correctly read from memory or received q-nary symbols, untrustworthily localized symbols are deleted, integrity of message is restored by correcting non-localized and erased q-nary symbols of each block, expressing their values through values of trustworthily localized or already corrected q-nary symbols, if trustworthy restoration of integrity of code block is impossible it is deleted, number of deleted blocks is counted, optimality is determined within observation interval of used code with correction of errors for current state of channel, if code optimum criterion exceeds given minimal and maximal limits, code is replaced with optimal code synchronously at transferring and receiving parts of channel in accordance to maximum transfer speed criterion.
EFFECT: efficiency of each protection type and increased quality of maintenance of guaranteed characteristics of informational system.
FIELD: technology for requesting a service between devices on home network.
SUBSTANCE: in accordance to method, requesting side detects descriptor of requested service and sends, with usage of aforementioned descriptor, request of service to requested side. After receipt of request, protocol stack of requested side determined, whether requested service exists, and whether rental connection to requested side is set up between requesting side and requested side. If no, than request process is finished. If yes, than requested side sends response message. After receipt of response message, protocol stack of requesting side determines, whether necessary service exists at requested side and whether rental connection is established with it. If yes, than sides begin actual interactive service call processing, in opposite case, process is finished.
EFFECT: creation of method, capable of dividing resources between devices in home network and of providing reliability of service request.
7 cl, 4 dwg, 2 tbl
FIELD: method for connecting devices for realization of dynamic organization of home network.
SUBSTANCE: in the method for all devices requiring equal connection, connection configuration is performed, which includes configuring information of account, containing username and password for allowing connections, and maximal number of parallel connections, permitted by device.
EFFECT: expanded functional capabilities due to realization of dynamic reconfiguration of local home network.
15 cl, 3 dwg, 5 tbl
FIELD: data transfer technologies.
SUBSTANCE: for realization of method, computer network is used with terminals and network node stations. At least one server broadcast station is included in composition of aforementioned network. For realization of transparent broadcasting, network address of server broadcast station is set for network node stations as a step of rigid routing of broadcasting messages.
EFFECT: decreased network traffic, provision of centralized control over groups of network node stations independently on network topology.
FIELD: communications engineering.
SUBSTANCE: proposed method provides for easy selection of time to request recording of mobile center being relocatable between different burst transfer regions in burst-transmission radio communication system. Proposed device has burst-transmission region list timer and is built in mobile center of burst-transmission radio communication system. This burst-transmission region list provides for reducing alternate change-over effect when mobile center is controlled at burst-transmission region boundary or when it crosses this boundary. Burst-transmission region timer reading is chosen in mobile center dispensing with network-generated instructions to inform mobile center about timer reading. Comparison operations are executed in mobile center that also incorporates provision for finding out if it needs recording.
EFFECT: reduced change-over effect when mobile center is controlled at burst-transmission region boundary.
20 cl, 2 dwg
FIELD: optimizing operation of synchronous digital hierarchy network in multiple-service mode.
SUBSTANCE: proposed method that provides for enhancing route design efficiency in large networks and not only for minimizing network resources being used and equalizing network load includes following steps: division of SDH network into sub-networks using ring-circuit principle to form plurality of ring-circuit sub-networks and designing of initial routes for all service requests in SDH network; checkup of communication channel resources between sub-networks and within each sub-network for overload and re-designing of route, if overload is detected; checkup of load balance index in ring-circuit sub-network for complying with desired value; if it does, route is corrected; upon division of sub-networks into peripheral and central ones total index of each communication channel in central sub-networks is checked for meeting convergence property; if it does not, quantity of route design cycles is checked for exceeding desired limit; if it does, design is ceased, otherwise respective routes are re-designed.
EFFECT: enhanced stability and efficiency of multiple-service rendering optimization.
10 cl, 3 dwg
FIELD: mobile communications.
SUBSTANCE: in wireless communication method between terminal and base station, that support real-time packet transfer service mode and reliable packet transfer mode, one of the modes is chosen: real-time packet transfer service mode and reliable packet transfer mode. Transfer channel between terminal and base station is installed. Bidirectional packet data exchange is executed between terminal and base station through transfer channel in real-time.
EFFECT: creation of method and system of wireless communications, that is capable to executed bidirectional packet data transfer between terminal and base station, when the system is working in transparent mode or in mode without data acknowledgement.
55 cl, 9 dwg
FIELD: data transmission.
SUBSTANCE: same multimedia message can be used to encapsulate non-transferable by stream components of multimedia information and descriptors, related to transferable by stream components of multimedia information. The recipient extracts descriptors from multimedia message and accordingly initiates stream transfer sessions. Notification process, that is used to inform the receiving user agent about the presence of multimedia message, is the same regardless of component types which are located inside the message.
EFFECT: ensured consecutive transfer of non-transferable and transferable by stream components of multimedia information.
25 cl, 6 dwg
FIELD: multiple-address multimedia data transfer and selective servicing in universal mobile communication system.
SUBSTANCE: proposed method intended for multiple-address transfer of multimedia data in universal mobile telecommunication system (UMTS) of third-generation GPP for multiple-address transfer groups provides for introduction of multiple-address service data stream identifier so that each multiple-address region can receive various pieces of information in the framework of one service or one multiple-address service for region can be rendered at different level of servicing. In addition, provision is made for data stream indicator that can selectively receive different menu or channels for one multiple-address service within same region. In this way providing data stream identifier makes it possible to satisfy subscriber's requests for various services.
EFFECT: enlarged functional capabilities.
21 cl, 7 dwg
FIELD: digital data transfer by data exchange in burst switching systems.
SUBSTANCE: proposed method and device designed to transfer data in communication-system provide for detecting user's request for opening connection for data transfer, selecting open connection, opening chosen open connection circuit, and assigning communication resources corresponding to those set free as result of opening circuit of chosen open connection to user. According to one of invention alternatives chosen open connection is in open non-busy state.
EFFECT: enhanced efficiency of using communication-system resources under overload conditions of system.
34 cl, 13 dwg
FIELD: technology for automatically finding devices in network.
SUBSTANCE: in accordance to method, device of initiating side searches for resource controlling device, and if detected, sends to it a request for finding device, connection to which is required. If resource controlling device detects required device, then information, related to this device, is sent to device of initiating side. If there is no resource controlling device in the network, then initiating side device broadcasts to all other devices in the network its own device information and monitors broadcast information about all other devices. On receipt of information about other devices, to device, connection with which is required, from initiating side device a request for connection is dispatched, and after receipt of response appropriate operations are executed.
EFFECT: simplified search, simplified connection of devices in network.
4 cl, 5 dwg, 2 tbl
FIELD: technology for processing digital data by means of electric devices, in particular, engineering of devices for administrative, commercial, managing, controlling and analytic use.
SUBSTANCE: method for exchanging confidential information, including, in particular, operations for reproducing at a server of single information data block system for remote client terminal performed with decryption of identification address of remote terminal of client and with cryptographic transformation of information data, while transmission of single information data block for remote client terminal is performed in conjunction with generation and dispatching of any number of fake information data blocks.
EFFECT: prevented unauthorized access to information pertaining to connections between participants of confidential information exchange.
5 cl, 3 dwg
FIELD: cryptographic data protection in radio and local computer networks.
SUBSTANCE: data protection method in radio and local computer networks with limitations on access to network clients, is characterized by encryption of text portion of packet with keys, individual for each pair of clients by means of two-parameter encrypting transformation vi=F(ui,ξi) and decrypting transformation ui=F-1(vi,ξi) on basis of random replacement table Tk having length of 2l symbols, where l - length of alphabet element, ui - combination, transformed during encryption, vi - encryption result, ξi - transformation parameter, for encryption of next information combination ui, transferred from client with number t to client with number g, source value ui is found in table Tk, difference of values of addresses of clients Δ=g-t is calculated by module 2l, value Δ is masked by randomly filled masking table Tm, for which purpose from table Tm at address Δ result of masking ΔM is read, value ΔM is used as transformation parameter ξi of symbol ui subjected to encryption, while encrypting transformation of symbol is performed using table Tk and additional addresses table Ta, in which in row with address ui address of combination ui in table Tk is stored, address of combination ui is determined, address of transformation result is calculated as sum by module 2l of address of combination ui and value ΔM and transformation result vi is read by calculated address from table Tk, decrypting transformation of symbol is performed using table Tk and additional addresses table Ta, in which in a row with address vi an address of combination vi in table Tk is stored, address of combination vi is determined, address of transformation result ui is determined as difference by module 2l of combinationaddress vi and value ΔM and transformation result ui is read by calculated address from table Tk.
EFFECT: encryption of information by keys, individual for each pair of clients, with fast realization of cryptographic transformation.
FIELD: communications engineering.
SUBSTANCE: proposed method includes signal division into time intervals, utterance of subscriber whose voice signal is to be encoded being recorded in advance; transmission of these intervals over different communication channels chosen from preset law; filling of spaces between them in each channel with background produced from recorded utterance by dividing it into time intervals of same length and interchanging obeying random law.
EFFECT: enhanced degree of transferred signal protection against unwanted persons.
1 cl, 8 dwg
FIELD: radio engineering.
SUBSTANCE: signal is divided on time intervals, and transfer of time intervals is performed along several data channels, while each time interval is transferred along separate channel, selected randomly.
EFFECT: higher efficiency.
FIELD: communications engineering, in particular, engineering of data transfer systems for decoding cyclic interference-resistant codes without preliminary phasing.
SUBSTANCE: during decoding of cyclic interference-resistant code, range of presumed lengths of code combinations [nmin-nmax] is determined, and assumed phase of beginning of code combination f is set, from phase f in received code series several presumed code combinations Si are selected and pairs are formed from selected combinations in accordance to condition Si≠Sk, N of greatest common divisors, represented by polynomials, is calculated, and from calculated polynomials a polynomial of least order is selected, which is considered equal to original polynomial g(x) of cyclic interference-resistant code, if N of greatest common divisors is equal to "1", then length of proposed code combination n is increased by one, phase of proposed beginning of code combination is altered for one, if greatest common divisor, different from "1", is not found for all n∈[nmin-nmax], combinations of errors are determined in code word and selected code combinations are decoded.
EFFECT: development of method for decoding cyclic interference-resistant code under conditions of adaptation of interference-resistant code to quality of information transfer channel.