Borodzhieva, 2024 - Google Patents
MS Excel-based Implementation of Schmidt-Samoa CryptosystemsBorodzhieva, 2024
- Document ID
- 13216822865565719005
- Author
- Borodzhieva A
- Publication year
- Publication venue
- 2024 5th International Conference on Communications, Information, Electronic and Energy Systems (CIEES)
External Links
Snippet
This paper describes the working principle of a Schmidt-Samoa cryptosystem, examining in detail the three main stages–key generation, encryption, and decryption. The most difficult points in the three stages are pointed out, with guidance given for dealing with the elusive …
- 238000000034 method 0 abstract description 30
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communication
- H04L9/08—Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
- H04L9/0816—Key establishment, i.e. cryptographic processes or cryptographic protocols whereby a shared secret becomes available to two or more parties, for subsequent use
- H04L9/0838—Key agreement, i.e. key establishment technique in which a shared key is derived by parties as a function of information contributed by, or associated with, each of these
- H04L9/0841—Key agreement, i.e. key establishment technique in which a shared key is derived by parties as a function of information contributed by, or associated with, each of these involving Diffie-Hellman or related key agreement protocols
- H04L9/0844—Key agreement, i.e. key establishment technique in which a shared key is derived by parties as a function of information contributed by, or associated with, each of these involving Diffie-Hellman or related key agreement protocols with user authentication or key authentication, e.g. ElGamal, MTI, MQV-Menezes-Qu-Vanstone protocol or Diffie-Hellman protocols using implicitly-certified keys
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communication
- H04L9/08—Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
- H04L9/0816—Key establishment, i.e. cryptographic processes or cryptographic protocols whereby a shared secret becomes available to two or more parties, for subsequent use
- H04L9/0819—Key transport or distribution, i.e. key establishment techniques where one party creates or otherwise obtains a secret value, and securely transfers it to the other(s)
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communication
- H04L9/30—Public key, i.e. encryption algorithm being computationally infeasible to invert or user's encryption keys not requiring secrecy
- H04L9/3066—Public key, i.e. encryption algorithm being computationally infeasible to invert or user's encryption keys not requiring secrecy involving algebraic varieties, e.g. elliptic or hyper-elliptic curves
- H04L9/3073—Public key, i.e. encryption algorithm being computationally infeasible to invert or user's encryption keys not requiring secrecy involving algebraic varieties, e.g. elliptic or hyper-elliptic curves involving pairings, e.g. identity based encryption [IBE], bilinear mappings or bilinear pairings, e.g. Weil or Tate pairing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communication
- H04L9/30—Public key, i.e. encryption algorithm being computationally infeasible to invert or user's encryption keys not requiring secrecy
- H04L9/3006—Public key, i.e. encryption algorithm being computationally infeasible to invert or user's encryption keys not requiring secrecy underlying computational problems or public-key parameters
- H04L9/302—Public key, i.e. encryption algorithm being computationally infeasible to invert or user's encryption keys not requiring secrecy underlying computational problems or public-key parameters involving the integer factorization problem, e.g. RSA or quadratic sieve [QS] schemes
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communication
- H04L9/06—Cryptographic mechanisms or cryptographic arrangements for secret or secure communication the encryption apparatus using shift registers or memories for block-wise or stream coding, e.g. DES systems or RC4; Hash functions; Pseudorandom sequence generators
- H04L9/0618—Block ciphers, i.e. encrypting groups of characters of a plain text message using fixed encryption transformation
Similar Documents
Publication | Publication Date | Title |
---|---|---|
Zhang | Cryptanalysis of the public key encryption based on multiple chaotic systems | |
US5463690A (en) | Method and apparatus for public key exchange in a cryptographic system | |
US5159632A (en) | Method and apparatus for public key exchange in a cryptographic system | |
JP3862500B2 (en) | High-speed elliptic curve encryption method and apparatus by direct embedding method | |
EP3794762B1 (en) | Method and system for communicating a secret | |
EP2742644B1 (en) | Encryption and decryption method | |
Agrawal et al. | Elliptic curve cryptography with hill cipher generation for secure text cryptosystem | |
EP4465589A1 (en) | Data processing | |
Borodzhieva | MS Excel-based Implementation of Schmidt-Samoa Cryptosystems | |
Wardlaw | The RSA public key cryptosystem | |
HS et al. | Comparative study and performance analysis of encryption in RSA, ECC and Goldwasser-Micali cryptosystems | |
Bashminova et al. | Cryptography methods in protecting financial transactions | |
Borodzhieva | Software implementation of a module for encryption and decryption using the RSA algorithm | |
Opalikhina | Applied aspects of number theory | |
Awad et al. | A NEW APPROACH COMBINING RSA AND ELGAMAL ALGORITHMS: ADVANCEMENTS IN ENCRYPTION AND DIGITAL SIGNATURES USING GAUSSIAN INTEGERS. | |
KR20010000048A (en) | Efficient and fast multiple points scalar multiplication method over elliptic curve using m-ary method | |
Martınez et al. | A Java implementation of the Elliptic Curve Integrated Encryption Scheme | |
Raharinirina | Use of signed permutations in cryptography | |
Lloris Ruiz et al. | Two Galois Fields Cryptographic Applications | |
SULTAN | ElGamal Cryptosystem | |
Mohanta et al. | Enhancing the security of public key cryptographic model based on integrated elgamal-elliptic curve diffe hellman (EG-ECDH) key exchange technique | |
Patili et al. | THE BASIC CRYPTOLOGY: A SIMPLE EXPLANATION OF HOW PRIME FACTORIZATION (MATHEMATICS) IS USED IN THE FIELD OF CRYPTOLOGY | |
Khalfin | Application of the Chinese Remainder Theorem to Cryptography and Cybersecurity | |
KR101259934B1 (en) | Learning System for RSA Cryptography Algorithm Education and Self-study method | |
Singh et al. | Understanding RSA Algorithm in Cryptography |