Boolean functions with multiplicative complexity 3 and 4

Çağdaş Çalık, Meltem Sönmez Turan, René Peralta

Open source

DOI: 10.1007/s12095-020-00445-z
Published: 2020-07-18
Container: Cryptography and Communications
Publisher: Springer Science and Business Media LLC
Open access: unknown

Credibility signals

uncertain Score 64/100 under policy 1.0.0. This is a metadata assessment, not a judgment of the paper's conclusions.

Show all credibility signals

supportingDOI registered: A matching record was returned by Crossref. Source: Crossref; license: CC0 metadata
supportingDOI resolves: A matching record was returned by Crossref. Source: Crossref; license: CC0 metadata
not scoredDirectory of Open Access Journals: No matching DOAJ record was present in this response. No allow-list match; this is not evidence of low credibility. Source: DOAJ; license: CC0
not scoredMEDLINE indexed: Not checked or no result supplied; no credibility inference made. Source: No authority result supplied; license: Unknown
not scoredOpenAlex core source: Not checked or no result supplied; no credibility inference made. Source: No authority result supplied; license: Unknown
not scoredKnown publisher allow-list: Not checked or no result supplied; no credibility inference made. Source: No authority result supplied; license: Unknown
not scoredROR affiliation: Not checked or no result supplied; no credibility inference made. Source: No authority result supplied; license: Unknown
not scoredRetraction Watch retraction: No retraction notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete. Source: Retraction Watch; license: CC BY 4.0
not scoredRetraction Watch expression of concern: No expression of concern notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete. Source: Retraction Watch; license: CC BY 4.0
not scoredRetraction Watch correction: No correction notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete. Source: Retraction Watch; license: CC BY 4.0
not scoredRetraction Watch reinstatement: No reinstatement notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete. Source: Retraction Watch; license: CC BY 4.0
not scoredOpen access status: Not checked or no result supplied; no credibility inference made. Source: No authority result supplied; license: Unknown
not scoredPublication license: Not checked or no result supplied; no credibility inference made. Source: No authority result supplied; license: Unknown
not scoredPublication version: A publication version was supplied but is not scored. Source: Normalized work metadata; license: Caller-provided; provenance license not supplied to scorer
supportingMetadata completeness: All 6 scored descriptive metadata groups are present. Source: Normalized work metadata; license: Caller-provided; provenance license not supplied to scorer

Cite this work

BibTeX

@article{allodium:10.1007/s12095-020-00445-z,
  title = {Boolean functions with multiplicative complexity 3 and 4},
  author = {Çağdaş Çalık and Meltem Sönmez Turan and René Peralta},
  year = {2020},
  journal = {Cryptography and Communications},
  doi = {10.1007/s12095-020-00445-z},
  url = {https://doi.org/10.1007/s12095-020-00445-z}
}

RIS

TY  - JOUR
TI  - Boolean functions with multiplicative complexity 3 and 4
AU  - Çağdaş Çalık
AU  - Meltem Sönmez Turan
AU  - René Peralta
PY  - 2020
JO  - Cryptography and Communications
DO  - 10.1007/s12095-020-00445-z
UR  - https://doi.org/10.1007/s12095-020-00445-z
ER  -

APA

Çalık, Ç., Turan, M. S., & Peralta, R. (2020). Boolean functions with multiplicative complexity 3 and 4. Cryptography and Communications. https://doi.org/10.1007/s12095-020-00445-z

Source records

crossref · retrieved 2026-09-26T08:38:44.605Z