Number theory and related algorithms in cryptography
A proposed public key distribution protocol, which is based on diffie-hellman problem is a two-pass protocol and has many of desirable secrity; the protocol is an extension diffie-hellman key exchange using random numbers and establishes a shared key K.
Подобные документы
A new general mathematical problem, suitable for public-key cryptosystems, is proposed: morphism computation in a category of Abelian groups. The problem seems to be hard for solving with a quantum computer. A demonstrative example of encryption.
??????, добавлен 15.09.2012A computational complexity based theory of modern encryption. Generating pseudo-random bit or number sequences. Generic encryption with pseudorandom functions. Problems with deterministic encryption in general. Required properties for digital cash.
?????, добавлен 08.03.2014???????????? ????? Infrared Data Association. ???????? ?????????? ?????? IrOBEX (Object Exchange Protocol). ???????? ???????? ??????????. ?????????????? Bluetooth, ????? ??????????????. ????????? ? ????????? ?????????. ?????????????? ? ?????????? ??????.
??????, добавлен 09.11.2013The principle of quantum cryptography. Quantum no-cloning theorem. State detection and random number generator. Verify assumptions used in a security proof. Quantum hacking and countermeasures from this. Introduction of cryptography for engineers.
?????, добавлен 08.03.2014Error correction and the cascade protocol. Individual attacks in an realistic environment. Dynamic initial block-size. Statistical analysis of QKD networks in real-life environment. Quantum-cryptographic networks from a prototype to the citizen.
?????, добавлен 08.03.2014Tools for Security and Insecurity. Unbiasing a Biased Coin. Combining Weak Sources of Entropy. Pseudorandom Number Generators. Random Permutation Generation. Sound Approach to Random Number Generation and Use. Computationally Secure Information Stealing.
?????, добавлен 08.03.2014Computational and Mathematical Preliminaries: computability, complexity, intractability. Efficient Number-Theoretic Algorithms and Intractable Problems. Public-Key Cryptography and Type Crytposystems. Integer Factorization and Discrete Logarithm Attacks.
?????, добавлен 08.03.2014Digital signatures: background and definitions. Cryptographic hardness assumptions and constructions based on general assumptions, signature schemes based on the (strong) RSA assumption. The random oracle model and full-domain hash (related) schemes.
?????, добавлен 08.03.2014Analysis of affine coordinates for pairing computation. Construction of designated connfirmer signature and its application to optimistic fair exchange. Designing a code generator for pairing based cryptographic functions and efficient constructions.
?????, добавлен 08.03.2014Basics of Contemporary Cryptography. Codes for Error Detection. Advances in Coding Theory and Cryptography. Encryption Basics. Authentication Codes in the Query Model. Collision in the DSA Function. Fuzzy Identity-based Encryption: Efficient Schemes.
??????? ???????, добавлен 08.03.2014Crypto applications of combinatorial group theory. Generating rooted trees of nodes uniformly at random. Designs, strongly regular graphs and codes constructed from some primitive groups. Quantum jump codes and some related combinatorial designs.
??????? ???????, добавлен 08.03.2014The value of cluster analysis to explain a number of phenomena. Consideration clustering algorithms computational intelligence, particularly based on neural networks and kernel-based learning. Review their application to five's real world problems.
??????, добавлен 08.02.2013- 38. ?????????? ?????
???????? ???????? ??? ????????????????? ?????. ??????? ???????? ??????? ????? ?????????? ???????? ?????????. ?????????????? Simple Network Management Protocol, ??? ??????? ????????. ?????????? ???????? get-next. ???????? ? ???? ????????? SNMPv1.
???????? ??????, добавлен 21.11.2013 Classical cryptography and quantum computation, as well as the signature scheme to the security of Merkle. Challenges in quantum cryptography and the authentication path computation. Basic designs and variations of multivariate public-key cryptography.
????????? ???????????, добавлен 08.03.2014??????? ? ???? IP-?????: Pv4, IPv6, IPng. ?????? ISO/OSI ? TCP/IP, ??????? ??????????. ??????? ???????????? Internet Protocol. ??????? ???????????? ??????????, ?? ????????? ????. ?????? IP-????????? ? ????????? ? ?????. ????????? ??????? ?????????.
???????????, добавлен 02.02.2016- 41. RSA Labs FAQ 4.0
Some of the more popular techniques in cryptography. The advantages and disadvantages of public-key cryptography compared with secret-key cryptography. Digital signature applications exportable from the United States. Proactive security techniques.
?????, добавлен 08.03.2014 ???????????? ? ??????????? ???????????? web-??????????, ??????????? ?? ??????????? ??????-??????. ?????? ?????????? ??????? ?????. ???????? ???????????????? ?????? web-??????. ??????? ?????????? simple object access protocol. ??????????? web-??????.
??????????? ??????, добавлен 18.01.2014?????????????? ????????? "1?: ???????????". MicrosoftBizTalkServer ??? ?????? ?????????????????? ??????????. ?????? ??????????? ???-?????: SimpleObjectAccess Protocol, Web Services Description Language. ????? ?????????? Extensible Markup Language.
???????? ??????, добавлен 15.08.2012??????? ????? ??? ???????? ????????????? ??????????, ??????????? ? ???????????? ????. ?????????? ?????????????-???. ?????? ?????? ????????? Address Resolution Protocol. ???????????? ? ????????????????? ???????????. ????????????? ???????? ??????????.
???????, добавлен 03.03.2015Criteria for desirable cryptographic systems and protocols. Security properties for authenticated key establishment. Standard notation of mathematical foundations. Classical ciphers: usefulness and security. The optimal asymmetric encryption padding.
?????, добавлен 13.03.2014Characterization of the foundations of modern cryptography for practitioners. Description of codes for error detection. Definition of advance in coding theory and cryptography. The main advances in algebraic geometry codes and coding in cryptology.
?????, добавлен 08.03.2014The purpose of this article is to review adaptive random testing is an improved version of random testing, that adapts the test case generation process based on the feedback from the previous test cases. Adaptive random testing aims to increase the fault.
??????, добавлен 13.12.2024Basics of Contemporary Cryptography for Information Technology Practitioners. Codes for Error Detection. Advances in Coding Theory and Cryptography. Arcs, minihypers, and the classification of three-dimensional Griesmer codes. About the code equivalence.
?????, добавлен 08.03.2014Enigma cipher machine. Cryptographic ally strong sequences. Shift register-based stream ciphers. Hellman’s time-memory trade-off. Birthday attacks on hash functions. Secondary phase refinement. Implementation attacks. Sigaba rotor in reverse orientation
??????? ???????, добавлен 08.03.2014Cryptography in the Information Age. Information Protection Problems in Computer Systems. The Fundamentals of One-Key Cryptography. Substituion—Permutation Networks with Minimal Controlled Elements. Designing Fast Ciphers Based on Controlled Operations.
?????, добавлен 08.03.2014