Log in

Relevant bibliographies by topics / Multivariate quadratic cryptosystem

Contents

Journal articles
Dissertations / Theses
Book chapters

Academic literature on the topic 'Multivariate quadratic cryptosystem'

Author: Grafiati

Published: 4 June 2021

Last updated: 10 February 2022

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

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Multivariate quadratic 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.

Journal articles on the topic "Multivariate quadratic cryptosystem"

1

Selvakumar, K., and S. Naveen Kumar. "Multivariate Quadratic Quasigroup Polynomial based Cryptosystem in Vanet." International Journal of Engineering & Technology 7, no. 4.10 (2018): 832. http://dx.doi.org/10.14419/ijet.v7i4.10.26767.

Full text

Abstract:

Vehicular Ad-hoc Network (VANET) is a developing transmission system to abet in the everyday organization of vehicular traffic and safety of vehicles (nodes). Unsigned verification is one of the key necessities in VANET gives the confidentiality of the root of the message. Current security conventions in VANET’s gives unsigned verification depends on the two-tier architecture, comprises of two VANET components, particularly nodes and Roadside Units (RsU’s) functioning as the key developing server (KDS). This protocol depends densely on RsU’s to give unsigned identification to the nodes. In thi

APA, Harvard, Vancouver, ISO, and other styles

2

Sun, Yan Jun, Chang Ming Liu, Hai Yu Li, and Zhe Yuan. "One-Way Function Construction Based on the MQ Problem and Logic Function." Applied Mechanics and Materials 220-223 (November 2012): 2360–63. http://dx.doi.org/10.4028/www.scientific.net/amm.220-223.2360.

Full text

Abstract:

Multivariate quadratic based public-key cryptography called MQ problem which based on calculation of a secure cryptography of multivariate equations and MQ cryptography security is based on the difficulty of the solution of multivariate equations. But computer and mathematician scientists put a lot of effort and a long time to research MQ cryptography and they have proved that MQ cryptography is NP complete problem. Therefore, before the P problem Equal to the NP problem we do not figure out selected multivariate equations by random in polynomial time. So we can use this feature to construct t

APA, Harvard, Vancouver, ISO, and other styles

3

Huixian, Li, Gao Jin, Wang Lingyun, and Pang Liaojun2. "MPKC-based Threshold Proxy Signcryption Scheme." International Arab Journal of Information Technology 17, no. 2 (2019): 196–206. http://dx.doi.org/10.34028/iajit/17/2/7.

Full text

Abstract:

The threshold proxy signcryption can implement signature and encryption simultaneously in one logical step, and can be used to realize the decentralized protection of the group signature key, so it is an efficient technology for network security. Currently, most of the existing threshold proxy signcryption schemes are designed based on the traditional public key cryptosystems, and their security mainly depends on the difficulty of the large integer decomposition and the discrete logarithm. However, the traditional public key cryptosystems cannot resist the quantum computer attack, which makes

APA, Harvard, Vancouver, ISO, and other styles

4

DING, JINTAI, TIMOTHY J. HODGES, VICTORIA KRUGLOV, DIETER SCHMIDT, and STEFAN TOHǍNEANU. "GROWTH OF THE IDEAL GENERATED BY A QUADRATIC MULTIVARIATE FUNCTION OVER GF(3)." Journal of Algebra and Its Applications 12, no. 05 (2013): 1250219. http://dx.doi.org/10.1142/s0219498812502192.

Full text

Abstract:

Let K be the field GF(3). We calculate the growth of the ideal Aλ where A is the algebra of functions from Kn → Kn and λ is a quadratic function. Specifically we calculate dim Akλ where Ak is the space of polynomials of degree less than or equal to k. This question arises in the analysis of the complexity of Gröbner basis attacks on multivariate quadratic cryptosystems such as the Hidden Field Equation systems. We also prove analogous results over the associated graded ring [Formula: see text] and state conjectures for the case of a general finite field of odd order.

APA, Harvard, Vancouver, ISO, and other styles

5

Kandiy, S. O., and G. A. Maleeva. "Analysis of the complexity of attacks on multivariate cryptographic transformations using algebraic field structure." Radiotekhnika, no. 204 (April 9, 2021): 59–65. http://dx.doi.org/10.30837/rt.2021.1.204.06.

Full text

Abstract:

In recent years, interest in cryptosystems based on multidimensional quadratic transformations (MQ transformations) has grown significantly. This is primarily due to the NIST PQC competition [1] and the need for practical electronic signature schemes that are resistant to attacks on quantum computers. Despite the fact that the world community has done a lot of work on cryptanalysis of the presented schemes, many issues need further clarification. NIST specialists are very cautious about the standardization process and urge cryptologists [4] in the next 3 years to conduct a comprehensive analys

APA, Harvard, Vancouver, ISO, and other styles

6

HASHIMOTO, Yasufumi. "Key Recovery Attacks on Multivariate Public Key Cryptosystems Derived from Quadratic Forms over an Extension Field." IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E100.A, no. 1 (2017): 18–25. http://dx.doi.org/10.1587/transfun.e100.a.18.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

DING, JINTAI, and TIMOTHY HODGES. "CRYPTANALYSIS OF AN IMPLEMENTATION SCHEME OF THE TAMED TRANSFORMATION METHOD CRYPTOSYSTEM." Journal of Algebra and Its Applications 03, no. 03 (2004): 273–82. http://dx.doi.org/10.1142/s0219498804000861.

Full text

Abstract:

A Tamed Transformation Method (TTM) cryptosystem was proposed by T. T. Moh in 1999. We describe how the first implementation scheme of the TTM system can be defeated. The computational complexity of our attack is 233 computations on the finite field with 28 elements. The cipher of the TTM systems are degree 2 polynomial maps derived from composition of invertible maps of either total degree 2 or linear maps which can be easily calculated and can be easily inverted. To ensure the system to be of degree two, the key construction of the implementation schemes of the TTM systems is a multivariable

APA, Harvard, Vancouver, ISO, and other styles

8

Harayama, Tomohiro, and Donald K. Friesen. "Weil sum for birthday attack in multivariate quadratic cryptosystem." Mathematical Cryptology 1, no. 1 (2007). http://dx.doi.org/10.1515/jmc.2007.006.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Alam, Bilal, Ferruh Özbudak, and Oğuz Yayla. "Classes of weak Dembowski–Ostrom polynomials for multivariate quadratic cryptosystems." Journal of Mathematical Cryptology 9, no. 1 (2015). http://dx.doi.org/10.1515/jmc-2013-0019.

Full text

Abstract:

AbstractT. Harayama and D. K. Friesen [J. Math. Cryptol. 1 (2007), 79–104] proposed the linearized binomial attack for multivariate quadratic cryptosystems and introduced weak Dembowski–Ostrom (DO) polynomials in this framework over the finite field 𝔽

APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Multivariate quadratic cryptosystem"

1

Harayama, Tomohiro. "A method of Weil sum in multivariate quadratic cryptosystem." Texas A&M University, 2003. http://hdl.handle.net/1969.1/5938.

Full text

Abstract:

A new cryptanalytic application is proposed for a number theoretic tool Weil sum to the birthday attack against multivariate quadratic trapdoor function. This new customization of the birthday attack is developed by evaluating the explicit Weil sum of the underlying univariate polynomial and the exact number of solutions of the associated bivariate equation. I designed and implemented new algorithms for computing Weil sum values so that I could explicitly identify some class of weak Dembowski- Ostrom polynomials and the equivalent forms in the multivariate quadratic trapdoor function. This cus

APA, Harvard, Vancouver, ISO, and other styles

2

Feldmann, Adam. "A Survey of Attacks on Multivariate Cryptosystems." Thesis, University of Waterloo, 2005. http://hdl.handle.net/10012/1032.

Full text

Abstract:

This thesis provides a survey of the attacks on multivariate cryptosystems. We begin by providing an outline of the general multivariate cryptosystem. Proceeding from there, we show that even with this level of detail, there are several attacks that are possible, including the method of Groebner bases, the XL method, and the recently announced method of Dixon resultants. Less general attack techniques also exist, such as MinRank attacks and differential analysis. These attacks lack the universality of the first three mentioned. In order to explore these less general attacks furt

APA, Harvard, Vancouver, ISO, and other styles

3

Maia, Ricardo José Menezes. "Análise da viabilidade da implementação de algoritmos pós-quânticos baseados em quase-grupos multivariados quadráticos em plataformas de processamento limitadas." Universidade de São Paulo, 2010. http://www.teses.usp.br/teses/disponiveis/3/3141/tde-30112010-151111/.

Full text

Abstract:

Redes de sensores sem fio (RSSF) tipicamente consistem de nós sensores com limitação de energia, processamento, comunicação e memória. A segurança em RSSF está se tornando fundamental com o surgimento de aplicações que necessitam de mecanismos que permitam autenticidade, integridade e confidencialidade. Devido a limitações de recursos em RSSF, adequar criptossistemas de chaves públicas (PKC) para estas redes é um problema de pesquisa em aberto. Meados de 2008, Danilo Gligoroski et al. propuseram um novo PKC baseado em quase-grupos multivariados quadráticos (MQQ). Experimentos feitos por Gligor

APA, Harvard, Vancouver, ISO, and other styles

4

Hu, Yuh-Hua, and 胡裕華. "Design Issues of Multivariate Quadratic Public Key Cryptosystems." Thesis, 2008. http://ndltd.ncl.edu.tw/handle/74456482398160532573.

Full text

Abstract:

博士<br>國立臺灣大學<br>資訊工程學研究所<br>96<br>Many public key cryptosystems are based on univariate polynomials with low degree but the inverse of the polynomials are high degree polynomials. Thus it is time consuming to compute the inverse of the polynomials. Multivariate Quadratic Public Key Cryptosystem (MQPKC) can overcome this problem. The first MQPKC was proposed by Fell and Diffie [33]. Until now, there have been dozens of MQPKCs proposed. However most of them were broken. How to design a secure and practical MQPKC is still unknown. In order to study how to design a MQPKC, we survey the multivaria

APA, Harvard, Vancouver, ISO, and other styles

5

Hu, Yuh-Hua. "Design Issues of Multivariate Quadratic Public Key Cryptosystems." 2008. http://www.cetd.com.tw/ec/thesisdetail.aspx?etdun=U0001-2806200800214100.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Multivariate quadratic cryptosystem"

1

Hu, Yuh-Hua, Lih-Chung Wang, Chun-Yen Chou, and Feipei Lai. "Similar Keys of Multivariate Quadratic Public Key Cryptosystems." In Cryptology and Network Security. Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11599371_18.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

"MQ or Multivariate Quadratic Public-Key Cryptosystem (MQPKC)." In Encyclopedia of Cryptography and Security. Springer US, 2011. http://dx.doi.org/10.1007/978-1-4419-5906-5_1134.

Full text

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!