Jump to ContentJump to Main Navigation
Show Summary Details
More options …

Formalized Mathematics

(a computer assisted approach)

Editor-in-Chief: Matuszewski, Roman

4 Issues per year


SCImago Journal Rank (SJR) 2016: 0.207
Source Normalized Impact per Paper (SNIP) 2016: 0.315

Open Access
Online
ISSN
1898-9934
See all formats and pricing
More options …
Volume 20, Issue 1 (Jan 2012)

Issues

Z-modules

Yuichi Futa / Hiroyuki Okazaki / Yasunari Shidama
Published Online: 2012-09-12 | DOI: https://doi.org/10.2478/v10037-012-0007-z

Z-modules

In this article, we formalize Z-module, that is a module over integer ring. Z-module is necassary for lattice problems, LLL (Lenstra-Lenstra-Lovász) base reduction algorithm and cryptographic systems with lattices [11].

  • Grzegorz Bancerek. Curried and uncurried functions. Formalized Mathematics, 1(3):537-541, 1990.Google Scholar

  • Grzegorz Bancerek. The ordinal numbers. Formalized Mathematics, 1(1):91-96, 1990.Google Scholar

  • Grzegorz Bancerek and Krzysztof Hryniewiecki. Segments of natural numbers and finite sequences. Formalized Mathematics, 1(1):107-114, 1990.Google Scholar

  • Józef Białas. Group and field definitions. Formalized Mathematics, 1(3):433-439, 1990.Google Scholar

  • Czesław Byliński. Basic functions and operations on functions. Formalized Mathematics, 1(1):245-254, 1990.Google Scholar

  • Czesław Byliński. Binary operations. Formalized Mathematics, 1(1):175-180, 1990.Google Scholar

  • Czesław Byliński. Functions and their basic properties. Formalized Mathematics, 1(1):55-65, 1990.Google Scholar

  • Czesław Byliński. Functions from a set to a set. Formalized Mathematics, 1(1):153-164, 1990.Google Scholar

  • Czesław Byliński. Partial functions. Formalized Mathematics, 1(2):357-367, 1990.Google Scholar

  • Czesław Byliński. Some basic properties of sets. Formalized Mathematics, 1(1):47-53, 1990.Google Scholar

  • Daniele Micciancio and Shafi Goldwasser. Complexity of lattice problems: A cryptographic perspective (the international series in engineering and computer science). 2002.Google Scholar

  • Christoph Schwarzweller. The binomial theorem for algebraic structures. Formalized Mathematics, 9(3):559-564, 2001.Google Scholar

  • Andrzej Trybulec. Domains and their Cartesian products. Formalized Mathematics, 1(1):115-122, 1990.Google Scholar

  • Andrzej Trybulec. Tuples, projections and Cartesian products. Formalized Mathematics, 1(1):97-105, 1990.Google Scholar

  • Michał J. Trybulec. Integers. Formalized Mathematics, 1(3):501-505, 1990.Google Scholar

  • Wojciech A. Trybulec. Vectors in real linear space. Formalized Mathematics, 1(2):291-296, 1990.Google Scholar

  • Zinaida Trybulec. Properties of subsets. Formalized Mathematics, 1(1):67-71, 1990.Google Scholar

  • Edmund Woronowicz. Relations and their basic properties. Formalized Mathematics, 1(1):73-83, 1990.Google Scholar

  • Stanisław Żukowski. Introduction to lattice theory. Formalized Mathematics, 1(1):215-222, 1990.Google Scholar

About the article


Published Online: 2012-09-12

Published in Print: 2012-01-01


Citation Information: Formalized Mathematics, ISSN (Online) 1898-9934, ISSN (Print) 1426-2630, DOI: https://doi.org/10.2478/v10037-012-0007-z.

Export Citation

This content is open access.

Citing Articles

Here you can find all Crossref-listed publications in which this article is cited. If you would like to receive automatic email messages as soon as this article is cited in other publications, simply activate the “Citation Alert” on the top of this page.

[1]
Yuichi Futa and Yasunari Shidama
Formalized Mathematics, 2017, Volume 25, Number 2

Comments (0)

Please log in or register to comment.
Log in