Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Concept Videos

Vector Algebra: Graphical Method01:10

Vector Algebra: Graphical Method

12.0K
Vectors can be multiplied by scalars, added to other vectors, or subtracted from other vectors. The vector sum of two (or more) vectors is called the resultant vector or, for short, the resultant.
We use the laws of geometry to construct resultant vectors, followed by trigonometry to find vector magnitudes and directions. For a geometric construction of the sum of two vectors in a plane, we follow the parallelogram rule. Suppose two vectors are at arbitrary positions. Translate either one of...
12.0K
Convolution Properties I01:20

Convolution Properties I

144
Convolution computations can be simplified by utilizing their inherent properties.
The commutative property reveals that the input and the impulse response of an LTI (Linear Time-Invariant) system can be interchanged without affecting the output:
144
Vector Algebra: Method of Components01:08

Vector Algebra: Method of Components

13.8K
It is cumbersome to find the magnitudes of vectors using the parallelogram rule or using the graphical method to perform mathematical operations like addition, subtraction, and multiplication. There are two ways to circumvent this algebraic complexity. One way is to draw the vectors to scale, as in navigation, and read approximate vector lengths and angles (directions) from the graphs. The other way is to use the method of components.
In many applications, the magnitudes and directions of...
13.8K
Coordinates and Map Projections01:29

Coordinates and Map Projections

37
Coordinates and map projections are essential tools in accurately representing the Earth's surface for various applications, ranging from navigation to spatial analysis. The latitude and longitude coordinate system is a universally recognized framework for defining locations. Latitude specifies the distance of a point north or south of the equator, measured in degrees from 0° at the equator to 90° at the poles. Longitude indicates a location's position east or west of the prime meridian,...
37
SFG Algebra01:16

SFG Algebra

115
In Signal Flow Graph (SFG) algebra, the value a node represents is determined by the sum of all signals entering that node. This summed value is then transmitted through every branch leaving the node, making the SFG a powerful tool for visualizing and analyzing control systems.
Each node in an SFG corresponds to a variable, and the interactions between nodes are represented by branches with associated gains. When multiple branches lead into a node, the value at that node is the sum of the...
115
Properties of the z-Transform I01:17

Properties of the z-Transform I

176
The z-transform is a fundamental tool in digital signal processing, enabling the analysis of discrete-time systems through its various properties. It is an invaluable tool for analyzing discrete-time systems, offering a range of properties that simplify complex signal manipulations. One fundamental property is linearity. For any two discrete-time signals, the z-transform of their linear combination equals the same linear combination of their individual z-transforms. This property is essential...
176

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

Propagation properties of a non-linear mapping based on squaring in odd characteristic.

Cryptography and communications : discrete structures, Boolean functions and sequences·2024
Same author

Differential and Linear properties of vectorial boolean functions based on chi.

Cryptography and communications : discrete structures, Boolean functions and sequences·2023
Same journal

LRCS: Duality, LP bounds, and field size.

Designs, codes, and cryptography·2026
Same journal

Information-set decoding for convolutional codes.

Designs, codes, and cryptography·2025
Same journal

Knot theory and error-correcting codes.

Designs, codes, and cryptography·2025
Same journal

New results on non-disjoint and classical strong external difference families.

Designs, codes, and cryptography·2025
Same journal

Guessing less and better: improved attacks on GIFT-64.

Designs, codes, and cryptography·2025
Same journal

Conjunctive hierarchical secret sharing by finite geometry.

Designs, codes, and cryptography·2025
See all related articles

Related Experiment Video

Updated: Jun 18, 2025

Surface Mapping of Earth-like Exoplanets using Single Point Light Curves
06:48

Surface Mapping of Earth-like Exoplanets using Single Point Light Curves

Published on: May 10, 2020

3.5K

Algebraic properties of the maps .

Jan Schoone1, Joan Daemen1

  • 1Digital Security, Radboud University, Nijmegen, The Netherlands.

Designs, Codes, and Cryptography
|July 29, 2024
PubMed
Summary
This summary is machine-generated.

This study analyzes the algebraic properties of a Boolean map used in cryptography. Researchers found it

Keywords:
Boolean mapsChiCryptographyPolynomial mapsSymmetric cryptography

More Related Videos

Mapping Bacterial Functional Networks and Pathways in Escherichia Coli using Synthetic Genetic Arrays
14:06

Mapping Bacterial Functional Networks and Pathways in Escherichia Coli using Synthetic Genetic Arrays

Published on: November 12, 2012

46.4K
Use of Principal Components for Scaling Up Topographic Models to Map Soil Redistribution and Soil Organic Carbon
09:44

Use of Principal Components for Scaling Up Topographic Models to Map Soil Redistribution and Soil Organic Carbon

Published on: October 16, 2018

10.2K

Related Experiment Videos

Last Updated: Jun 18, 2025

Surface Mapping of Earth-like Exoplanets using Single Point Light Curves
06:48

Surface Mapping of Earth-like Exoplanets using Single Point Light Curves

Published on: May 10, 2020

3.5K
Mapping Bacterial Functional Networks and Pathways in Escherichia Coli using Synthetic Genetic Arrays
14:06

Mapping Bacterial Functional Networks and Pathways in Escherichia Coli using Synthetic Genetic Arrays

Published on: November 12, 2012

46.4K
Use of Principal Components for Scaling Up Topographic Models to Map Soil Redistribution and Soil Organic Carbon
09:44

Use of Principal Components for Scaling Up Topographic Models to Map Soil Redistribution and Soil Organic Carbon

Published on: October 16, 2018

10.2K

Area of Science:

  • Cryptography
  • Abstract Algebra
  • Number Theory

Background:

  • The Boolean map $x \mapsto x^{2^n-2}$ is a core component in several modern cryptographic permutations.
  • These permutations include Keccak-f (SHA-3), ASCON (NIST Lightweight competition winner), Xoodoo, Rasta, and Subterranean.
  • Understanding the algebraic properties of this map is crucial for cryptanalysis and the design of secure cryptographic systems.

Purpose of the Study:

  • To investigate the algebraic characteristics of the Boolean map $x \mapsto x^{2^n-2}$ over finite fields.
  • To determine conditions under which this map behaves as a power function and analyze its polynomial representations.
  • To examine the properties of the inverse map and its behavior on field extensions.

Main Methods:

  • Representing the Boolean map as a univariate polynomial over finite fields.
  • Analyzing the conditions for the map to be a power function using vectorial isomorphism.
  • Computing bounds on polynomial sparsity, degree, and the number of univariate representations.
  • Calculating the number of monomials in the inverse map's polynomial representation.
  • Investigating the map's behavior as a polynomial map on field extensions of $\mathbb{F}_{2^n}$.

Main Results:

  • The Boolean map $x \mapsto x^{2^n-2}$ is a power function if and only if $n=1$.
  • Bounds on the sparsity, degree, and number of univariate representations were computed.
  • The number of monomials of a given degree in the inverse map coincides with binomial coefficients.
  • The map $x \mapsto x^{2^n-2}$ does not yield a bijection on field extensions of $\mathbb{F}_{2^n}$ when the extension degree is divisible by 2 or 3.

Conclusions:

  • The study provides a comprehensive algebraic analysis of a key component in modern symmetric-key cryptography.
  • The findings offer insights into the structure and limitations of the Boolean map and its inverse.
  • A conjecture is proposed that the rule $x \mapsto x^{2^n-2}$ does not define a bijection on any extension field of $\mathbb{F}_{2^n}$.