Log in

Relevant bibliographies by topics / Quite proof symmetric cryptosystem / Journal articles

To see the other types of publications on this topic, follow the link: Quite proof symmetric cryptosystem.

Journal articles on the topic 'Quite proof symmetric cryptosystem'

Author: Grafiati

Published: 30 May 2022

Last updated: 31 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 25 journal articles for your research on the topic 'Quite proof symmetric cryptosystem.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Zhong, Sheng. "An Efficient and Secure Cryptosystem for Encrypting Long Messages." Fundamenta Informaticae 71, no. 4 (2006): 493–97. https://doi.org/10.3233/fun-2006-71407.

Full text

Abstract:

Traditionally, due to efficiency considerations, when encrypting long messages using an asymmtric cryptosystem, one needs to use a symmetric cryptosystem in addition. To eliminate this requirement, Hwang, Chang, and Hwang introduced an asymmetric cryptosystem for encrypting long messages. However, they did not give any formal proof of the security of this cryptosystem. In this paper, we propose an improved asymmetric cryptosystem for encrypting long messages, which is both efficient and secure. In the aspect of efficiency, our cryptosystem is about twice as fast as the Hwang-Chang-Hwang crypto

APA, Harvard, Vancouver, ISO, and other styles

2

DZHULIY, V., I. MULYAR, V. ORLENKO, V. TITOVA, and V. ANIKIN. "SYMMETRIC CRYPTOSYSTEM WITH NONLINEAR ENCRYPTION AND THE POSSIBILITY OF CONTROL OF CIPHERTEXT FOR CONCEALMENT." Herald of Khmelnytskyi National University. Technical sciences 291, no. 6 (2020): 33–38. https://doi.org/10.31891/2307-5732-2020-291-6-33-38.

Full text

Abstract:

The article proposes a simple symmetric permutation cryptosystem, in which permutations occur based on streaming generation of random numbers. Substitution-permutation algorithms are quite common today. They have proven to be reliable crypto-strong ciphers that have seriously competed with iterative mathematical ciphers, based on the Feistel network, and are gradually displacing them more and more, taking their place. The aim of the article is to propose an encryption algorithm that has a simple structure and is easy to implement. At the same time, it is estimated to be quite resistant to cryp

APA, Harvard, Vancouver, ISO, and other styles

3

Mao, Xuechun, Lin You, Chengtang Cao, Gengran Hu, and Liqin Hu. "Linkable Ring Signature Scheme Using Biometric Cryptosystem and NIZK and Its Application." Security and Communication Networks 2021 (December 15, 2021): 1–14. http://dx.doi.org/10.1155/2021/7266564.

Full text

Abstract:

Biometric encryption, especially based on fingerprint, plays an important role in privacy protection and identity authentication. In this paper, we construct a privacy-preserving linkable ring signature scheme. In our scheme, we utilize a fuzzy symmetric encryption scheme called symmetric keyring encryption (SKE) to hide the secret key and use non-interactive zero-knowledge (NIZK) protocol to ensure that we do not leak any information about the message. Unlike the blind signature, we use NIZK protocol to cancel the interaction between the signer (the prover) and the verifier. The security proo

APA, Harvard, Vancouver, ISO, and other styles

4

Ruan, Ou, and Hao Mao. "Efficient Private Set Intersection Using Point-Value Polynomial Representation." Security and Communication Networks 2020 (September 1, 2020): 1–12. http://dx.doi.org/10.1155/2020/8890677.

Full text

Abstract:

Private set intersection (PSI) allows participants to securely compute the intersection of their inputs, which has a wide range of applications such as privacy-preserving contact tracing of COVID-19. Most existing PSI protocols were based on asymmetric/symmetric cryptosystem. Therefore, keys-related operations would burden these systems. In this paper, we transform the problem of the intersection of sets into the problem of finding roots of polynomials by using point-value polynomial representation, blind polynomials’ point-value pairs for secure transportation and computation with the pseudor

APA, Harvard, Vancouver, ISO, and other styles

5

Althobaiti, Ohood Saud, Toktam Mahmoodi, and Mischa Dohler. "Intelligent Bio-Latticed Cryptography: A Quantum-Proof Efficient Proposal." Symmetry 14, no. 11 (2022): 2351. http://dx.doi.org/10.3390/sym14112351.

Full text

Abstract:

The emergence of the Internet of Things (IoT) and the tactile internet presents high-quality connectivity strengthened by next-generation networking to cover a vast array of smart systems. Quantum computing is another powerful enabler of the next technological revolution, which will improve the world tremendously, and it will continue to grow to cover an extensive array of important functions, in addition to it receiving recently great interest in the scientific scene. Because quantum computers have the potential to overcome various issues related to traditional computing, major worldwide tech

APA, Harvard, Vancouver, ISO, and other styles

6

Liu, Wanping, Xiaofan Yang, and Luxing Yang. "Global Behavior of Two Families of Nonlinear Symmetric Difference Equations." Discrete Dynamics in Nature and Society 2010 (2010): 1–15. http://dx.doi.org/10.1155/2010/367492.

Full text

Abstract:

We mainly investigate the global asymptotic stability and exponential convergence of positive solutions to two families of higher-order difference equations, one of which was recently studied in Stević's paper (2010). A new concise proof is given to a quite recent result by Stević and analogous parallel result of the other inverse equation, which extend related results of Aloqeili (2009), Berenhaut and Stević (2007), and Liao et al. (2009).

APA, Harvard, Vancouver, ISO, and other styles

7

Bikos, Anastasios N. "PRIVocular: Enhancing User Privacy Through Air-Gapped Communication Channels." Cryptography 9, no. 2 (2025): 29. https://doi.org/10.3390/cryptography9020029.

Full text

Abstract:

Virtual reality (VR)/the metaverse is transforming into a ubiquitous technology by leveraging smart devices to provide highly immersive experiences at an affordable price. Cryptographically securing such augmented reality schemes is of paramount importance. Securely transferring the same secret key, i.e., obfuscated, between several parties is the main issue with symmetric cryptography, the workhorse of modern cryptography, because of its ease of use and quick speed. Typically, asymmetric cryptography establishes a shared secret between parties, after which the switch to symmetric encryption c

APA, Harvard, Vancouver, ISO, and other styles

8

Kelly, G. M., and F. Rossi. "Topological categories with many symmetric monoidal closed structures." Bulletin of the Australian Mathematical Society 31, no. 1 (1985): 41–59. http://dx.doi.org/10.1017/s0004972700002264.

Full text

Abstract:

It would seem from results of Foltz, Lair, and Kelly that symmetric monoidal closed structures, and even monoidal biclosed ones, are quite rare on one-sorted algebraic or essentially-algebraic categories. They showed many such categories to admit no such structures at all, and others to admit only one or two; no such category is known to admit an infinite set of such structures.Among concrete categories, topological ones are in some sense at the other extreme from essentially-algebraic ones; and one is led to ask whether a topological category may admit many such structures. On the category of

APA, Harvard, Vancouver, ISO, and other styles

9

Korzhik, V. I., V. A. Yakovlev, B. V. Izotov, V. S. Starostin, and M. V. Buinevich. "Advance in Applied Cryptography Theory: Survey and New Results. Part 1. Key Cryptography." Proceedings of Telecommunication Universities 10, no. 4 (2024): 126–41. http://dx.doi.org/10.31854/1813-324x-2024-10-4-126-141.

Full text

Abstract:

In the current paper, consisting from two parts, are presented both results already published before (but hard for access) and new once. Actuality of this work is firstly in a fact that recently has been obtained a number of new results in area of applied cryptography that are needed both in a clarification and be put into practice. This is namely the main goal of the current paper. The setting problem in the first paper part concerns to a complexity of symmetric cipher breaking while in the second part of the paper is discussed, so called, keyless cryptography, namely: wiretap channel concept

APA, Harvard, Vancouver, ISO, and other styles

10

Pfister, Herbert. "A new and quite general existence proof for static and spherically symmetric perfect fluid stars in general relativity." Classical and Quantum Gravity 28, no. 7 (2011): 075006. http://dx.doi.org/10.1088/0264-9381/28/7/075006.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Naik, Tushar Kanta, Neha Nanda, and Mahender Singh. "Conjugacy classes and automorphisms of twin groups." Forum Mathematicum 32, no. 5 (2020): 1095–108. http://dx.doi.org/10.1515/forum-2019-0321.

Full text

Abstract:

AbstractThe twin group {T_{n}} is a right-angled Coxeter group generated by {n-1} involutions, and the pure twin group {\mathrm{PT}_{n}} is the kernel of the natural surjection from {T_{n}} onto the symmetric group on n symbols. In this paper, we investigate some structural aspects of these groups. We derive a formula for the number of conjugacy classes of involutions in {T_{n}}, which, quite interestingly, is related to the well-known Fibonacci sequence. We also derive a recursive formula for the number of z-classes of involutions in {T_{n}}. We give a new proof of the structure of {\operator

APA, Harvard, Vancouver, ISO, and other styles

12

Hoelscher, Zachary, та Eyvindur Palsson. "Counting Restricted Partitions of Integers Into Fractions: Symmetry and Modes of the Generating Function and a Connection to ω(t)". PUMP Journal of Undergraduate Research 3 (5 грудня 2020): 277–307. http://dx.doi.org/10.46787/pump.v3i0.2428.

Full text

Abstract:

Motivated by the study of integer partitions, we consider partitions of integers into fractions of a particular form, namely with constant denominators and distinct odd or even numerators. When numerators are odd, the numbers of partitions for integers smaller than the denominator form symmetric patterns. Such properties can be applied to a particular class of nonlinear Diophantine equations. Most importantly, we find that our restrictions enable an elementary proof of the unimodality of the nonzero terms of the generating function, which in general is quite hard. We also examine partitions wi

APA, Harvard, Vancouver, ISO, and other styles

13

Shah, Aayush, Prabhat Mahato, and Aadarsh Bhagat. "Enhancing Post-Quantum Cryptography: Exploring Mathematical Foundations and Comparative Analysis of Different Cryptographic Algorithm." International Journal for Research in Applied Science and Engineering Technology 11, no. 8 (2023): 1626–42. http://dx.doi.org/10.22214/ijraset.2023.55341.

Full text

Abstract:

Abstract: This research paper surveys the landscape of cryptography, encompassing historical origins and modern applications. Beginning with foundational concepts, it explores encryption, decryption, ciphers, and keys, spanning symmetric and asymmetric cryptography. Historical context unfolds, tracing cryptography from ancient Egyptian hieroglyphs to Julius Caesar's cipher. The study then transitions to contemporary subjects. Elliptic Curves and Cryptography are investigated, showcasing their significance in secure communication, demonstrating ECC key exchange and AES-GCM encryption using pyth

APA, Harvard, Vancouver, ISO, and other styles

14

Appleby, D. M., Christopher A. Fuchs, and Huangjun Zhu. "Group theoretic, Lie algebraic and Jordan algebraic formulations of the SIC existence problem." Quantum Information and Computation 15, no. 1&2 (2015): 61–94. http://dx.doi.org/10.26421/qic15.1-2-5.

Full text

Abstract:

Although symmetric informationally complete positive operator valued measures (SIC POVMs, or SICs for short) have been constructed in every dimension up to 67, a general existence proof remains elusive. The purpose of this paper is to show that the SIC existence problem is equivalent to three other, on the face of it quite different problems. Although it is still not clear whether these reformulations of the problem will make it more tractable, we believe that the fact that SICs have these connections to other areas of mathematics is of some intrinsic interest. Specifically, we reformulate the

APA, Harvard, Vancouver, ISO, and other styles

15

Janson, Svante, Subhabrata Sen, and Joel Spencer. "Preferential attachment when stable." Advances in Applied Probability 51, no. 4 (2019): 1067–108. http://dx.doi.org/10.1017/apr.2019.42.

Full text

Abstract:

AbstractWe study an urn process with two urns, initialized with a ball each. Balls are added sequentially, the urn being chosen independently with probability proportional to the $\alpha$th power $(\alpha >1)$ of the existing number of balls. We study the (rare) event that the urn compositions are balanced after the addition of $2n-2$ new balls. We derive precise asymptotics of the probability of this event by embedding the process in continuous time. Quite surprisingly, fine control of this probability may be leveraged to derive a lower-tail large deviation principle (LDP) for $L = \sum_{i

APA, Harvard, Vancouver, ISO, and other styles

16

KHOLODENKO, ARKADY L. "GRAVITY-ASSISTED SOLUTION OF THE MASS GAP PROBLEM FOR PURE YANG–MILLS FIELDS." International Journal of Geometric Methods in Modern Physics 08, no. 06 (2011): 1355–418. http://dx.doi.org/10.1142/s0219887811005646.

Full text

Abstract:

In 1979, Louis Witten demonstrated that stationary axially symmetric Einstein field equations and those for static axially symmetric self-dual SU (2) gauge fields can both be reduced to the same (Ernst) equation. In this paper, we use this result as point of departure to prove the existence of the mass gap for quantum source-free Yang–Mills (Y–M) fields. The proof is facilitated by results of our recently published paper, J. Geom. Phys.59 (2009) 600–619. Since both pure gravity, the Einstein–Maxwell and pure Y–M fields are described for axially symmetric configurations by the Ernst equation cl

APA, Harvard, Vancouver, ISO, and other styles

17

Landsman, Klaas, Valter Moretti та Christiaan J. F. van de Ven. "Strict deformation quantization of the state space of Mk(ℂ) with applications to the Curie–Weiss model". Reviews in Mathematical Physics 32, № 10 (2020): 2050031. http://dx.doi.org/10.1142/s0129055x20500312.

Full text

Abstract:

Increasing tensor powers of the [Formula: see text] matrices [Formula: see text] are known to give rise to a continuous bundle of [Formula: see text]-algebras over [Formula: see text] with fibers [Formula: see text] and [Formula: see text], where [Formula: see text], the state space of [Formula: see text], which is canonically a compact Poisson manifold (with stratified boundary). Our first result is the existence of a strict deformation quantization of [Formula: see text] à la Rieffel, defined by perfectly natural quantization maps [Formula: see text] (where [Formula: see text] is an equally

APA, Harvard, Vancouver, ISO, and other styles

18

Liu, Fukang, Mohammad Mahzoun, Morten Øygarden, and Willi Meier. "Algebraic Attacks on RAIN and AIM Using Equivalent Representations." IACR Transactions on Symmetric Cryptology 2023, no. 4 (2023): 166–86. http://dx.doi.org/10.46586/tosc.v2023.i4.166-186.

Full text

Abstract:

Designing novel symmetric-key primitives for advanced protocols like secure multiparty computation (MPC), fully homomorphic encryption (FHE) and zero-knowledge proof systems (ZK), has been an important research topic in recent years. Many such existing primitives adopt quite different design strategies from conventional block ciphers. Notable features include that many of these ciphers are defined over a large finite field, and that a power map is commonly used to construct the nonlinear component due to its efficiency in these applications as well as its strong resistance against the differen

APA, Harvard, Vancouver, ISO, and other styles

19

Bonchi, Filippo, Fabio Gadducci, Aleks Kissinger, Pawel Sobocinski, and Fabio Zanasi. "String Diagram Rewrite Theory I: Rewriting with Frobenius Structure." Journal of the ACM 69, no. 2 (2022): 1–58. http://dx.doi.org/10.1145/3502719.

Full text

Abstract:

String diagrams are a powerful and intuitive graphical syntax, originating in theoretical physics and later formalised in the context of symmetric monoidal categories. In recent years, they have found application in the modelling of various computational structures, in fields as diverse as Computer Science, Physics, Control Theory, Linguistics, and Biology. In several of these proposals, transformations of systems are modelled as rewrite rules of diagrams. These developments require a mathematical foundation for string diagram rewriting: whereas rewrite theory for terms is well-understood, the

APA, Harvard, Vancouver, ISO, and other styles

20

Díaz, Jesús Ildefonso, David Gómez-Castro, Alexander V. Podolskiy, and Tatiana A. Shaposhnikova. "Homogenization of a net of periodic critically scaled boundary obstacles related to reverse osmosis “nano-composite” membranes." Advances in Nonlinear Analysis 9, no. 1 (2018): 193–227. http://dx.doi.org/10.1515/anona-2018-0158.

Full text

Abstract:

Abstract One of the main goals of this paper is to extend some of the mathematical techniques of some previous papers by the authors showing that some very useful phenomenological properties which can be observed at the nano-scale can be simulated and justified mathematically by means of some homogenization processes when a certain critical scale is used in the corresponding framework. Here the motivating problem in consideration is formulated in the context of the reverse osmosis. We consider, on a part of the boundary of a domain {\Omega\subset\mathbb{R}^{n}} , a set of very small periodical

APA, Harvard, Vancouver, ISO, and other styles

21

Burgee, Tyler. "Superposition as a Means of Data Encryption in N-Dimensional Value Spaces." Proceedings of the West Virginia Academy of Science 95, no. 2 (2023). http://dx.doi.org/10.55632/pwvas.v95i2.956.

Full text

Abstract:

The objective of this study was to provide a new method for creating quantum-proof encryption algorithms. I accomplished this by designing a symmetric 2-key cryptosystem that exploits the superposition principle to encrypt data in multi-dimensional value spaces. The proposed cryptosystem substitutes characters for frequencies, as determined by two private keys: component wave order key (CWOK) and character transmission order key (CTOK). A CWOK defines the values and theoretical spatial arrangement of frequencies in a complex wave. A CTOK defines the unique arrangement of system character

APA, Harvard, Vancouver, ISO, and other styles

22

"On the Prime Geodesic Theorem for SL4." International Journal of Circuits, Systems and Signal Processing 14 (April 30, 2020). http://dx.doi.org/10.46300/9106.2020.14.7.

Full text

Abstract:

In 1949, A. Selberg discovered a real variable (an elementary) proof of the prime number theorem. A number of authors have adapted Selberg’s method to achieve quite a good corresponding error term. The Riemann hypothesis has never been proved or disproved however. Any generalization of the prime number theorem to the more general situations is known in literature as a prime geodesic theorem. In this paper we derive yet another proof of the prime geodesic theorem for compact symmetric spaces formed as quotients of the Lie group SL4 (R). While the first known proof in this setting applies contou

APA, Harvard, Vancouver, ISO, and other styles

23

Berntsson, Fredrik, Jennifer Chepkorir, and Vladimir Kozlov. "Accelerated Dirichlet–Robin alternating algorithms for solving the Cauchy problem for the Helmholtz equation." IMA Journal of Applied Mathematics, July 2, 2021. http://dx.doi.org/10.1093/imamat/hxab034.

Full text

Abstract:

Abstract The Cauchy problem for Helmholtz equation, for moderate wave number $k^{2}$, is considered. In the previous paper of Achieng et al. (2020, Analysis of Dirichlet–Robin iterations for solving the Cauchy problem for elliptic equations. Bull. Iran. Math. Soc.), a proof of convergence for the Dirichlet–Robin alternating algorithm was given for general elliptic operators of second order, provided that appropriate Robin parameters were used. Also, it has been noted that the rate of convergence for the alternating iterative algorithm is quite slow. Thus, we reformulate the Cauchy problem as a

APA, Harvard, Vancouver, ISO, and other styles

24

S. Farjana Farvin, R. Nithyashree, R. Sivanandhini, and D. R. Subasri. "U-MEDCHAIN A Blockchain Based System for Medical Records Access and Permissions Management." International Journal of Advanced Research in Science, Communication and Technology, April 13, 2023, 297–303. http://dx.doi.org/10.48175/ijarsct-9133.

Full text

Abstract:

In recent years, the interest in using wireless communication technologies and mobile devices in the healthcare environment has increased. However, despite increased attention to the security of electronic health records, patient privacy is still at risk for data breaches. Thus, it is quite a challenge to involve an access control system especially if the patient’s medical data are accessible by users who have diverse privileges in different situations. Blockchain is a new technology that can be adopted for decentralized access control management issues. In this work, blockchain based frame wo

APA, Harvard, Vancouver, ISO, and other styles

25

Saha, Chandan, and Bhargav Thankey. "Hitting Sets for Orbits of Circuit Classes and Polynomial Families." ACM Transactions on Computation Theory, May 23, 2024. http://dx.doi.org/10.1145/3665800.

Full text

Abstract:

The orbit of an n -variate polynomial f ( x ) over a field \({\mathbb {F}} \) is the set \(\text {orb}(f) := \lbrace f(A{\mathbf {x}}+{\mathbf {b}}) : A \in {\mathrm{GL}}(n,{\mathbb {F}}) \text{ and } {\mathbf {b}} \in {\mathbb {F}}^n\rbrace \) . The orbit of a polynomial f is a geometrically interesting subset of the set of affine projections of f . Affine projections of polynomials computable by seemingly weak circuit classes can be quite powerful. For example, the polynomial \(\mathsf {IMM}_{3,d} \) – the (1, 1)-th entry of a product of d generic 3 × 3 matrices – is computable by a constant

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!